./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:13:23,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:13:23,627 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:13:23,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:13:23,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:13:23,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:13:23,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:13:23,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:13:23,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:13:23,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:13:23,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:13:23,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:13:23,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:13:23,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:13:23,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:13:23,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:13:23,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:13:23,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:13:23,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:13:23,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:13:23,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:13:23,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:13:23,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:13:23,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:13:23,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:13:23,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:13:23,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:13:23,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:13:23,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:13:23,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:13:23,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:13:23,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:13:23,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:23,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:13:23,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:13:23,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:13:23,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:13:23,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:13:23,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:13:23,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:13:23,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:13:23,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:13:23,700 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce [2024-11-08 19:13:24,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:13:24,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:13:24,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:13:24,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:13:24,055 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:13:24,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i Unable to find full path for "g++" [2024-11-08 19:13:26,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:13:27,192 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:13:27,193 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-08 19:13:27,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/data/395137fb8/df3f120ffb6b4b00bee2c1d4fcba1a14/FLAGfb5748d59 [2024-11-08 19:13:27,480 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/data/395137fb8/df3f120ffb6b4b00bee2c1d4fcba1a14 [2024-11-08 19:13:27,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:13:27,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:13:27,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:27,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:13:27,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:13:27,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:27" (1/1) ... [2024-11-08 19:13:27,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa586dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:27, skipping insertion in model container [2024-11-08 19:13:27,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:13:27" (1/1) ... [2024-11-08 19:13:27,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:13:27,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i[915,928] [2024-11-08 19:13:27,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:27,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:13:27,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i[915,928] [2024-11-08 19:13:28,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:13:28,051 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:13:28,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28 WrapperNode [2024-11-08 19:13:28,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:13:28,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:28,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:13:28,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:13:28,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,143 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-08 19:13:28,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:13:28,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:13:28,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:13:28,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:13:28,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,208 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:13:28,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:13:28,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:13:28,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:13:28,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:13:28,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (1/1) ... [2024-11-08 19:13:28,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:13:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:13:28,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:13:28,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c454556c-7870-4a1f-bf72-9101f1088f29/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:13:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:13:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:13:28,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:13:28,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:13:28,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:13:28,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:13:28,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:13:28,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:13:29,124 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-08 19:13:29,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:13:29,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:13:29,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:13:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:29 BoogieIcfgContainer [2024-11-08 19:13:29,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:13:29,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:13:29,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:13:29,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:13:29,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:13:27" (1/3) ... [2024-11-08 19:13:29,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689fb76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:29, skipping insertion in model container [2024-11-08 19:13:29,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:13:28" (2/3) ... [2024-11-08 19:13:29,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689fb76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:13:29, skipping insertion in model container [2024-11-08 19:13:29,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:13:29" (3/3) ... [2024-11-08 19:13:29,175 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-34.i [2024-11-08 19:13:29,197 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:13:29,197 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:13:29,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:13:29,319 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@757f4929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:13:29,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:13:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:13:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 19:13:29,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:29,347 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:29,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -594020897, now seen corresponding path program 1 times [2024-11-08 19:13:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124951103] [2024-11-08 19:13:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:13:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:13:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:13:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:13:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:13:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:13:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:13:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:13:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:13:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:13:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:13:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:13:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124951103] [2024-11-08 19:13:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124951103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:13:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44702569] [2024-11-08 19:13:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:29,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:13:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:13:29,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:13:29,968 INFO L87 Difference]: Start difference. First operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:13:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:30,008 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-11-08 19:13:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:13:30,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-08 19:13:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:30,023 INFO L225 Difference]: With dead ends: 135 [2024-11-08 19:13:30,024 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 19:13:30,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:13:30,033 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:30,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:13:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 19:13:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 19:13:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:13:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-08 19:13:30,100 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2024-11-08 19:13:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:30,101 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-08 19:13:30,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:13:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-08 19:13:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 19:13:30,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:30,112 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:30,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:13:30,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -721751967, now seen corresponding path program 1 times [2024-11-08 19:13:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181822589] [2024-11-08 19:13:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:13:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:13:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:13:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:13:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:13:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:13:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:13:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:13:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:13:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:13:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:13:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:13:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181822589] [2024-11-08 19:13:31,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181822589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:31,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:13:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072113428] [2024-11-08 19:13:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:13:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:31,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:13:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:13:31,166 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:13:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:31,438 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2024-11-08 19:13:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:13:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-08 19:13:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:31,442 INFO L225 Difference]: With dead ends: 225 [2024-11-08 19:13:31,445 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 19:13:31,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:31,447 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:31,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:13:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 19:13:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2024-11-08 19:13:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:13:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2024-11-08 19:13:31,503 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2024-11-08 19:13:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:31,504 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2024-11-08 19:13:31,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:13:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2024-11-08 19:13:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 19:13:31,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:31,507 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:31,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:13:31,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:31,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1759731472, now seen corresponding path program 1 times [2024-11-08 19:13:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668320080] [2024-11-08 19:13:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:13:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:13:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:13:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:13:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:13:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:13:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:13:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:13:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:13:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:13:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:13:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:13:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:13:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:13:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:13:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:13:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668320080] [2024-11-08 19:13:32,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668320080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:13:32,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:13:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:13:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537258103] [2024-11-08 19:13:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:13:32,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:13:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:13:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:13:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:13:32,111 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:13:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:13:32,464 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2024-11-08 19:13:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:13:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-08 19:13:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:13:32,469 INFO L225 Difference]: With dead ends: 382 [2024-11-08 19:13:32,472 INFO L226 Difference]: Without dead ends: 254 [2024-11-08 19:13:32,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:13:32,478 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:13:32,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:13:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-08 19:13:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2024-11-08 19:13:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:13:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2024-11-08 19:13:32,516 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2024-11-08 19:13:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:13:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2024-11-08 19:13:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:13:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2024-11-08 19:13:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:13:32,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:13:32,520 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:13:32,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:13:32,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:13:32,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:13:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1372587497, now seen corresponding path program 1 times [2024-11-08 19:13:32,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:13:32,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263246287] [2024-11-08 19:13:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:13:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:13:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263246287] [2024-11-08 19:14:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263246287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 19:14:14,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122726502] [2024-11-08 19:14:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:14,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:14:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:14:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:14:14,980 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:20,688 INFO L93 Difference]: Finished difference Result 535 states and 786 transitions. [2024-11-08 19:14:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 19:14:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-08 19:14:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:20,692 INFO L225 Difference]: With dead ends: 535 [2024-11-08 19:14:20,695 INFO L226 Difference]: Without dead ends: 403 [2024-11-08 19:14:20,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:14:20,701 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 378 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:20,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 586 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 19:14:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-08 19:14:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2024-11-08 19:14:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.4223300970873787) internal successors, (293), 206 states have internal predecessors, (293), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 371 transitions. [2024-11-08 19:14:20,757 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 371 transitions. Word has length 96 [2024-11-08 19:14:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:20,757 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 371 transitions. [2024-11-08 19:14:20,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 371 transitions. [2024-11-08 19:14:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:14:20,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:20,764 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:20,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:14:20,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1147372437, now seen corresponding path program 1 times [2024-11-08 19:14:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793993664] [2024-11-08 19:14:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793993664] [2024-11-08 19:14:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793993664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:14:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128810419] [2024-11-08 19:14:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:14:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:14:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:14:24,216 INFO L87 Difference]: Start difference. First operand 249 states and 371 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:26,303 INFO L93 Difference]: Finished difference Result 608 states and 909 transitions. [2024-11-08 19:14:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:14:26,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-08 19:14:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:26,308 INFO L225 Difference]: With dead ends: 608 [2024-11-08 19:14:26,308 INFO L226 Difference]: Without dead ends: 460 [2024-11-08 19:14:26,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:14:26,311 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 362 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:26,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 376 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 19:14:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-08 19:14:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 294. [2024-11-08 19:14:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 251 states have (on average 1.4183266932270917) internal successors, (356), 251 states have internal predecessors, (356), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-08 19:14:26,364 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 96 [2024-11-08 19:14:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:26,366 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-08 19:14:26,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-08 19:14:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:14:26,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:26,374 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:26,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:14:26,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2052645867, now seen corresponding path program 1 times [2024-11-08 19:14:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975775213] [2024-11-08 19:14:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975775213] [2024-11-08 19:14:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975775213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:34,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:34,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:14:34,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951839938] [2024-11-08 19:14:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:34,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:14:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:34,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:14:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:14:34,147 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:36,825 INFO L93 Difference]: Finished difference Result 602 states and 884 transitions. [2024-11-08 19:14:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:14:36,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-08 19:14:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:36,830 INFO L225 Difference]: With dead ends: 602 [2024-11-08 19:14:36,830 INFO L226 Difference]: Without dead ends: 456 [2024-11-08 19:14:36,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:14:36,832 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 366 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:36,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 448 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 19:14:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-08 19:14:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2024-11-08 19:14:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 311 states have (on average 1.459807073954984) internal successors, (454), 311 states have internal predecessors, (454), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 532 transitions. [2024-11-08 19:14:36,870 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 532 transitions. Word has length 96 [2024-11-08 19:14:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:36,871 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 532 transitions. [2024-11-08 19:14:36,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 532 transitions. [2024-11-08 19:14:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:14:36,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:36,874 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:36,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:14:36,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash 102454426, now seen corresponding path program 1 times [2024-11-08 19:14:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273818502] [2024-11-08 19:14:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273818502] [2024-11-08 19:14:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273818502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:14:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758550445] [2024-11-08 19:14:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:14:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:14:39,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:14:39,075 INFO L87 Difference]: Start difference. First operand 354 states and 532 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:39,847 INFO L93 Difference]: Finished difference Result 656 states and 980 transitions. [2024-11-08 19:14:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-08 19:14:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:39,852 INFO L225 Difference]: With dead ends: 656 [2024-11-08 19:14:39,852 INFO L226 Difference]: Without dead ends: 472 [2024-11-08 19:14:39,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:39,854 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:39,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 345 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:14:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-08 19:14:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 360. [2024-11-08 19:14:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 317 states have (on average 1.444794952681388) internal successors, (458), 317 states have internal predecessors, (458), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 536 transitions. [2024-11-08 19:14:39,895 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 536 transitions. Word has length 96 [2024-11-08 19:14:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 536 transitions. [2024-11-08 19:14:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2024-11-08 19:14:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 19:14:39,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:39,898 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:39,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:14:39,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash 361470247, now seen corresponding path program 1 times [2024-11-08 19:14:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342575463] [2024-11-08 19:14:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342575463] [2024-11-08 19:14:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342575463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:40,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:14:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619161282] [2024-11-08 19:14:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:40,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:14:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:40,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:14:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:40,375 INFO L87 Difference]: Start difference. First operand 360 states and 536 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:40,664 INFO L93 Difference]: Finished difference Result 576 states and 859 transitions. [2024-11-08 19:14:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:14:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-08 19:14:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:40,667 INFO L225 Difference]: With dead ends: 576 [2024-11-08 19:14:40,667 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 19:14:40,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:14:40,669 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:40,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:14:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 19:14:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 322. [2024-11-08 19:14:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-08 19:14:40,718 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2024-11-08 19:14:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-08 19:14:40,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-08 19:14:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:14:40,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:40,722 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:40,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:14:40,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:40,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1130006363, now seen corresponding path program 1 times [2024-11-08 19:14:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:40,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628714087] [2024-11-08 19:14:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628714087] [2024-11-08 19:14:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628714087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:45,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:45,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:14:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087687397] [2024-11-08 19:14:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:45,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:14:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:14:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:45,039 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:47,122 INFO L93 Difference]: Finished difference Result 647 states and 936 transitions. [2024-11-08 19:14:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:14:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-08 19:14:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:47,126 INFO L225 Difference]: With dead ends: 647 [2024-11-08 19:14:47,126 INFO L226 Difference]: Without dead ends: 515 [2024-11-08 19:14:47,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:14:47,128 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 260 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:47,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 480 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 19:14:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-08 19:14:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 358. [2024-11-08 19:14:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 508 transitions. [2024-11-08 19:14:47,194 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 508 transitions. Word has length 97 [2024-11-08 19:14:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 508 transitions. [2024-11-08 19:14:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 508 transitions. [2024-11-08 19:14:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:14:47,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:47,198 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:47,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:14:47,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1965098215, now seen corresponding path program 1 times [2024-11-08 19:14:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118788487] [2024-11-08 19:14:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:14:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:14:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:14:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:14:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:14:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:14:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:14:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:14:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:14:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:14:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:14:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:14:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:14:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:14:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118788487] [2024-11-08 19:14:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118788487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:52,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:52,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:14:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596721101] [2024-11-08 19:14:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:14:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:14:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:14:52,191 INFO L87 Difference]: Start difference. First operand 358 states and 508 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:57,470 INFO L93 Difference]: Finished difference Result 841 states and 1200 transitions. [2024-11-08 19:14:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:14:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-08 19:14:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:57,475 INFO L225 Difference]: With dead ends: 841 [2024-11-08 19:14:57,475 INFO L226 Difference]: Without dead ends: 625 [2024-11-08 19:14:57,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:14:57,477 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 371 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:57,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 428 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 19:14:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-08 19:14:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 441. [2024-11-08 19:14:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3914141414141414) internal successors, (551), 396 states have internal predecessors, (551), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:14:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 629 transitions. [2024-11-08 19:14:57,546 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 629 transitions. Word has length 97 [2024-11-08 19:14:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 629 transitions. [2024-11-08 19:14:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:14:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 629 transitions. [2024-11-08 19:14:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 19:14:57,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:57,550 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:57,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:14:57,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:57,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:57,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1285039845, now seen corresponding path program 1 times [2024-11-08 19:14:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:57,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516072563] [2024-11-08 19:14:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:15:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:15:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:15:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:15:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:15:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:15:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:15:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:15:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:15:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:15:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:15:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:15:08,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516072563] [2024-11-08 19:15:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516072563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 19:15:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487382965] [2024-11-08 19:15:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:15:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:15:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:15:08,837 INFO L87 Difference]: Start difference. First operand 441 states and 629 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:15:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:12,472 INFO L93 Difference]: Finished difference Result 832 states and 1170 transitions. [2024-11-08 19:15:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:15:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-08 19:15:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:12,477 INFO L225 Difference]: With dead ends: 832 [2024-11-08 19:15:12,477 INFO L226 Difference]: Without dead ends: 543 [2024-11-08 19:15:12,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:15:12,480 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 272 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:12,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 757 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 19:15:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-08 19:15:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2024-11-08 19:15:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3888888888888888) internal successors, (550), 396 states have internal predecessors, (550), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:15:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-08 19:15:12,538 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 97 [2024-11-08 19:15:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-08 19:15:12,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:15:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-08 19:15:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:15:12,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:12,541 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:15:12,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -580770604, now seen corresponding path program 1 times [2024-11-08 19:15:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750769022] [2024-11-08 19:15:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:15:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:15:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:15:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:15:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:15:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:15:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:15:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:15:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:15:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:15:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:15:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:15:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750769022] [2024-11-08 19:15:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750769022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:15:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961148561] [2024-11-08 19:15:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:15:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:15:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:26,905 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:31,452 INFO L93 Difference]: Finished difference Result 785 states and 1112 transitions. [2024-11-08 19:15:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 19:15:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:15:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:31,457 INFO L225 Difference]: With dead ends: 785 [2024-11-08 19:15:31,458 INFO L226 Difference]: Without dead ends: 557 [2024-11-08 19:15:31,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-08 19:15:31,460 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 356 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:31,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 531 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 19:15:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-08 19:15:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2024-11-08 19:15:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 376 states have (on average 1.3936170212765957) internal successors, (524), 376 states have internal predecessors, (524), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:15:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 602 transitions. [2024-11-08 19:15:31,525 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 602 transitions. Word has length 98 [2024-11-08 19:15:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:31,526 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 602 transitions. [2024-11-08 19:15:31,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 602 transitions. [2024-11-08 19:15:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:15:31,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:31,528 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:31,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:15:31,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 99287766, now seen corresponding path program 1 times [2024-11-08 19:15:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986292804] [2024-11-08 19:15:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:15:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:15:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:15:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:15:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:15:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:15:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:15:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:15:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:15:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:15:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:15:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:15:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986292804] [2024-11-08 19:15:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986292804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:15:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135906537] [2024-11-08 19:15:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:35,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:15:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:15:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:15:35,486 INFO L87 Difference]: Start difference. First operand 421 states and 602 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:37,050 INFO L93 Difference]: Finished difference Result 717 states and 1016 transitions. [2024-11-08 19:15:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:15:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:37,055 INFO L225 Difference]: With dead ends: 717 [2024-11-08 19:15:37,055 INFO L226 Difference]: Without dead ends: 485 [2024-11-08 19:15:37,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:37,057 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 232 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:37,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 338 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 19:15:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-08 19:15:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 411. [2024-11-08 19:15:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.3934426229508197) internal successors, (510), 366 states have internal predecessors, (510), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:15:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions. [2024-11-08 19:15:37,114 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 98 [2024-11-08 19:15:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:37,117 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 588 transitions. [2024-11-08 19:15:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions. [2024-11-08 19:15:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:15:37,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:37,122 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:37,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:15:37,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:37,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 714354438, now seen corresponding path program 1 times [2024-11-08 19:15:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211820867] [2024-11-08 19:15:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:15:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:15:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:15:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:15:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:15:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:15:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:15:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:15:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:15:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:15:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:15:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:15:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:43,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211820867] [2024-11-08 19:15:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211820867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:43,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:43,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:15:43,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999382302] [2024-11-08 19:15:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:43,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:15:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:43,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:15:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:43,086 INFO L87 Difference]: Start difference. First operand 411 states and 588 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:51,508 INFO L93 Difference]: Finished difference Result 922 states and 1314 transitions. [2024-11-08 19:15:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 19:15:51,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:15:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:51,514 INFO L225 Difference]: With dead ends: 922 [2024-11-08 19:15:51,515 INFO L226 Difference]: Without dead ends: 704 [2024-11-08 19:15:51,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:15:51,517 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 509 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 394 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 19:15:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-08 19:15:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 427. [2024-11-08 19:15:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 382 states have (on average 1.387434554973822) internal successors, (530), 382 states have internal predecessors, (530), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:15:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 608 transitions. [2024-11-08 19:15:51,578 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 608 transitions. Word has length 98 [2024-11-08 19:15:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:51,578 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 608 transitions. [2024-11-08 19:15:51,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:15:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 608 transitions. [2024-11-08 19:15:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:15:51,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:51,582 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:51,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:15:51,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1805605496, now seen corresponding path program 1 times [2024-11-08 19:15:51,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099967598] [2024-11-08 19:15:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:15:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:15:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:15:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:15:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:15:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:15:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:15:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:15:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:15:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:15:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:15:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:15:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:15:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:15:57,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:57,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099967598] [2024-11-08 19:15:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099967598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:57,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:15:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102069845] [2024-11-08 19:15:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:15:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:57,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:15:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:57,302 INFO L87 Difference]: Start difference. First operand 427 states and 608 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:04,323 INFO L93 Difference]: Finished difference Result 917 states and 1302 transitions. [2024-11-08 19:16:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 19:16:04,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:16:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:04,328 INFO L225 Difference]: With dead ends: 917 [2024-11-08 19:16:04,328 INFO L226 Difference]: Without dead ends: 687 [2024-11-08 19:16:04,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:16:04,331 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 406 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:04,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 408 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 19:16:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-08 19:16:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 449. [2024-11-08 19:16:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 404 states have (on average 1.386138613861386) internal successors, (560), 404 states have internal predecessors, (560), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:16:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 638 transitions. [2024-11-08 19:16:04,392 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 638 transitions. Word has length 98 [2024-11-08 19:16:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:04,393 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 638 transitions. [2024-11-08 19:16:04,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 638 transitions. [2024-11-08 19:16:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:16:04,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:04,395 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:16:04,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:16:04,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:04,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1394412808, now seen corresponding path program 1 times [2024-11-08 19:16:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962115576] [2024-11-08 19:16:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:16:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:16:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:16:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:16:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:16:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:16:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:16:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:16:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:16:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:16:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:16:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:16:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:16:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:16:14,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:14,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962115576] [2024-11-08 19:16:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962115576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:16:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686597979] [2024-11-08 19:16:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:16:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:16:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:16:14,390 INFO L87 Difference]: Start difference. First operand 449 states and 638 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:17,964 INFO L93 Difference]: Finished difference Result 920 states and 1301 transitions. [2024-11-08 19:16:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:16:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:16:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:17,968 INFO L225 Difference]: With dead ends: 920 [2024-11-08 19:16:17,969 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 19:16:17,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:16:17,971 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 312 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:17,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 435 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 19:16:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 19:16:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 457. [2024-11-08 19:16:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 412 states have (on average 1.3762135922330097) internal successors, (567), 412 states have internal predecessors, (567), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:16:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 645 transitions. [2024-11-08 19:16:18,030 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 645 transitions. Word has length 98 [2024-11-08 19:16:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 645 transitions. [2024-11-08 19:16:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 645 transitions. [2024-11-08 19:16:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 19:16:18,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:18,033 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:16:18,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 19:16:18,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:18,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1125547126, now seen corresponding path program 1 times [2024-11-08 19:16:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922466980] [2024-11-08 19:16:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:16:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:16:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:16:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:16:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:16:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:16:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:16:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:16:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:16:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:16:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:16:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:16:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:16:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:16:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922466980] [2024-11-08 19:16:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922466980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:16:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134099533] [2024-11-08 19:16:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:28,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:16:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:16:28,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:16:28,579 INFO L87 Difference]: Start difference. First operand 457 states and 645 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:32,473 INFO L93 Difference]: Finished difference Result 807 states and 1121 transitions. [2024-11-08 19:16:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:16:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-08 19:16:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:32,478 INFO L225 Difference]: With dead ends: 807 [2024-11-08 19:16:32,479 INFO L226 Difference]: Without dead ends: 565 [2024-11-08 19:16:32,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:16:32,481 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 236 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:32,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 493 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 19:16:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-08 19:16:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 465. [2024-11-08 19:16:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 420 states have (on average 1.369047619047619) internal successors, (575), 420 states have internal predecessors, (575), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:16:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 653 transitions. [2024-11-08 19:16:32,534 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 653 transitions. Word has length 98 [2024-11-08 19:16:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:32,535 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 653 transitions. [2024-11-08 19:16:32,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:16:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 653 transitions. [2024-11-08 19:16:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:16:32,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:32,537 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:16:32,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:16:32,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -645177569, now seen corresponding path program 1 times [2024-11-08 19:16:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005781251] [2024-11-08 19:16:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:17:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:17:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:17:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:17:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:17:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:17:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:17:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:17:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:17:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:17:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:17:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:17:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:17:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:17:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:17:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:17:42,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005781251] [2024-11-08 19:17:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005781251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:17:42,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:17:42,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:17:42,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156154269] [2024-11-08 19:17:42,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:17:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:17:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:17:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:17:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:17:42,106 INFO L87 Difference]: Start difference. First operand 465 states and 653 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:17:44,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:17:44,558 INFO L93 Difference]: Finished difference Result 753 states and 1023 transitions. [2024-11-08 19:17:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:17:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2024-11-08 19:17:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:17:44,562 INFO L225 Difference]: With dead ends: 753 [2024-11-08 19:17:44,562 INFO L226 Difference]: Without dead ends: 751 [2024-11-08 19:17:44,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-11-08 19:17:44,564 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 405 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:17:44,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 721 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 19:17:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-08 19:17:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 525. [2024-11-08 19:17:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 480 states have (on average 1.3583333333333334) internal successors, (652), 480 states have internal predecessors, (652), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:17:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 730 transitions. [2024-11-08 19:17:44,631 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 730 transitions. Word has length 99 [2024-11-08 19:17:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:17:44,631 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 730 transitions. [2024-11-08 19:17:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:17:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 730 transitions. [2024-11-08 19:17:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:17:44,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:17:44,634 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:17:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 19:17:44,635 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:17:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:17:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1462826019, now seen corresponding path program 1 times [2024-11-08 19:17:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:17:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564771829] [2024-11-08 19:17:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:17:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:17:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:18:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:18:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:18:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:18:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:18:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:18:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:18:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:18:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:18:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:18:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:18:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:18:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:18:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:18:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564771829] [2024-11-08 19:18:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564771829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:18:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070568342] [2024-11-08 19:18:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:46,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:18:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:18:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:18:46,908 INFO L87 Difference]: Start difference. First operand 525 states and 730 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:18:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:49,259 INFO L93 Difference]: Finished difference Result 784 states and 1061 transitions. [2024-11-08 19:18:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:18:49,260 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2024-11-08 19:18:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:49,263 INFO L225 Difference]: With dead ends: 784 [2024-11-08 19:18:49,263 INFO L226 Difference]: Without dead ends: 782 [2024-11-08 19:18:49,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:18:49,265 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 295 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:49,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 684 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 19:18:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-08 19:18:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 582. [2024-11-08 19:18:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 537 states have (on average 1.3407821229050279) internal successors, (720), 537 states have internal predecessors, (720), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:18:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 798 transitions. [2024-11-08 19:18:49,333 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 798 transitions. Word has length 99 [2024-11-08 19:18:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 798 transitions. [2024-11-08 19:18:49,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:18:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 798 transitions. [2024-11-08 19:18:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:18:49,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:49,336 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:49,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:18:49,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash -222475743, now seen corresponding path program 1 times [2024-11-08 19:18:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266618098] [2024-11-08 19:18:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:18:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:18:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:18:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:18:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:18:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:18:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:18:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:18:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:18:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:18:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:18:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:18:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:18:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:18:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266618098] [2024-11-08 19:18:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266618098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:49,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:18:49,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910070697] [2024-11-08 19:18:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:18:49,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:18:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:18:49,566 INFO L87 Difference]: Start difference. First operand 582 states and 798 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:18:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:49,740 INFO L93 Difference]: Finished difference Result 1040 states and 1437 transitions. [2024-11-08 19:18:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:18:49,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-08 19:18:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:49,743 INFO L225 Difference]: With dead ends: 1040 [2024-11-08 19:18:49,744 INFO L226 Difference]: Without dead ends: 621 [2024-11-08 19:18:49,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:18:49,745 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 92 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:49,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 371 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:18:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-08 19:18:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 585. [2024-11-08 19:18:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 540 states have (on average 1.3388888888888888) internal successors, (723), 540 states have internal predecessors, (723), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:18:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 801 transitions. [2024-11-08 19:18:49,811 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 801 transitions. Word has length 99 [2024-11-08 19:18:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:49,811 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 801 transitions. [2024-11-08 19:18:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:18:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 801 transitions. [2024-11-08 19:18:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:18:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:49,813 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:49,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 19:18:49,814 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 243830276, now seen corresponding path program 1 times [2024-11-08 19:18:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110706512] [2024-11-08 19:18:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:18:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:18:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:18:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:18:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:18:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:18:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:18:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:18:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:18:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:18:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:18:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:18:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:18:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:18:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:18:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:18:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110706512] [2024-11-08 19:18:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110706512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:18:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:18:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:18:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209969381] [2024-11-08 19:18:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:18:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:18:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:18:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:18:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:18:54,345 INFO L87 Difference]: Start difference. First operand 585 states and 801 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:18:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:18:56,707 INFO L93 Difference]: Finished difference Result 1089 states and 1515 transitions. [2024-11-08 19:18:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:18:56,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-08 19:18:56,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:18:56,712 INFO L225 Difference]: With dead ends: 1089 [2024-11-08 19:18:56,713 INFO L226 Difference]: Without dead ends: 847 [2024-11-08 19:18:56,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:18:56,715 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 179 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:18:56,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 517 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 19:18:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-08 19:18:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 575. [2024-11-08 19:18:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 530 states have (on average 1.3377358490566038) internal successors, (709), 530 states have internal predecessors, (709), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:18:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 787 transitions. [2024-11-08 19:18:56,781 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 787 transitions. Word has length 99 [2024-11-08 19:18:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:18:56,782 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 787 transitions. [2024-11-08 19:18:56,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:18:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 787 transitions. [2024-11-08 19:18:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:18:56,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:18:56,785 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:18:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 19:18:56,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:18:56,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:18:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 923888646, now seen corresponding path program 1 times [2024-11-08 19:18:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:18:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291414338] [2024-11-08 19:18:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:18:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:18:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:19:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:19:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:19:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:19:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:19:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:19:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:19:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:19:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:19:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:19:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:19:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:19:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:19:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:19:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:19:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291414338] [2024-11-08 19:19:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291414338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:19:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:19:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:19:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639599214] [2024-11-08 19:19:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:19:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:19:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:19:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:19:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:19:11,552 INFO L87 Difference]: Start difference. First operand 575 states and 787 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:19:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:19:14,808 INFO L93 Difference]: Finished difference Result 939 states and 1283 transitions. [2024-11-08 19:19:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:19:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-08 19:19:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:19:14,813 INFO L225 Difference]: With dead ends: 939 [2024-11-08 19:19:14,813 INFO L226 Difference]: Without dead ends: 701 [2024-11-08 19:19:14,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:19:14,816 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 192 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:19:14,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 673 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 19:19:14,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-08 19:19:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 555. [2024-11-08 19:19:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 510 states have (on average 1.3392156862745097) internal successors, (683), 510 states have internal predecessors, (683), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:19:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 761 transitions. [2024-11-08 19:19:14,880 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 761 transitions. Word has length 99 [2024-11-08 19:19:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:19:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 761 transitions. [2024-11-08 19:19:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:19:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 761 transitions. [2024-11-08 19:19:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:19:14,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:19:14,883 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:19:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 19:19:14,883 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:19:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:19:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1714612650, now seen corresponding path program 1 times [2024-11-08 19:19:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:19:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142410396] [2024-11-08 19:19:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:19:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:19:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:19:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:19:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:19:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:19:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:19:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:19:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:19:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:19:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:19:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:19:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:19:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:19:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:19:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:19:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:19:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:19:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142410396] [2024-11-08 19:19:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142410396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:19:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:19:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:19:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63381027] [2024-11-08 19:19:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:19:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:19:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:19:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:19:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:19:20,707 INFO L87 Difference]: Start difference. First operand 555 states and 761 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:19:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:19:25,374 INFO L93 Difference]: Finished difference Result 941 states and 1312 transitions. [2024-11-08 19:19:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:19:25,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-08 19:19:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:19:25,378 INFO L225 Difference]: With dead ends: 941 [2024-11-08 19:19:25,378 INFO L226 Difference]: Without dead ends: 707 [2024-11-08 19:19:25,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:19:25,380 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 216 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:19:25,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 472 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 19:19:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-08 19:19:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 547. [2024-11-08 19:19:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 502 states have (on average 1.3366533864541832) internal successors, (671), 502 states have internal predecessors, (671), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:19:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 749 transitions. [2024-11-08 19:19:25,442 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 749 transitions. Word has length 99 [2024-11-08 19:19:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:19:25,442 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 749 transitions. [2024-11-08 19:19:25,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:19:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 749 transitions. [2024-11-08 19:19:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:19:25,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:19:25,445 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:19:25,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 19:19:25,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:19:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:19:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash 918430435, now seen corresponding path program 1 times [2024-11-08 19:19:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:19:25,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268269861] [2024-11-08 19:19:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:19:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:19:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:20:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:20:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:20:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:20:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:20:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:20:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:20:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:20:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:20:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:20:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:20:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:20:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:20:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:20:33,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:20:33,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268269861] [2024-11-08 19:20:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268269861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:20:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:20:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 19:20:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836306330] [2024-11-08 19:20:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:20:33,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:20:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:20:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:20:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:20:33,152 INFO L87 Difference]: Start difference. First operand 547 states and 749 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:20:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:20:35,869 INFO L93 Difference]: Finished difference Result 769 states and 1027 transitions. [2024-11-08 19:20:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:20:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 100 [2024-11-08 19:20:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:20:35,873 INFO L225 Difference]: With dead ends: 769 [2024-11-08 19:20:35,873 INFO L226 Difference]: Without dead ends: 767 [2024-11-08 19:20:35,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:20:35,874 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 356 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:20:35,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 611 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 19:20:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-08 19:20:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 568. [2024-11-08 19:20:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 523 states have (on average 1.3422562141491396) internal successors, (702), 523 states have internal predecessors, (702), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:20:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 780 transitions. [2024-11-08 19:20:35,925 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 780 transitions. Word has length 100 [2024-11-08 19:20:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:20:35,926 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 780 transitions. [2024-11-08 19:20:35,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:20:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 780 transitions. [2024-11-08 19:20:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:20:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:20:35,928 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:20:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 19:20:35,928 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:20:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:20:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -92686815, now seen corresponding path program 1 times [2024-11-08 19:20:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:20:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472999477] [2024-11-08 19:20:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:20:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:20:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:20:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:20:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:20:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:20:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:20:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:20:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:20:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:20:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:20:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:20:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:20:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:20:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:20:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:20:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:20:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:20:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472999477] [2024-11-08 19:20:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472999477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:20:36,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:20:36,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:20:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701362585] [2024-11-08 19:20:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:20:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:20:36,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:20:36,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:20:36,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:20:36,048 INFO L87 Difference]: Start difference. First operand 568 states and 780 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:20:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:20:36,122 INFO L93 Difference]: Finished difference Result 953 states and 1316 transitions. [2024-11-08 19:20:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:20:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-08 19:20:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:20:36,126 INFO L225 Difference]: With dead ends: 953 [2024-11-08 19:20:36,126 INFO L226 Difference]: Without dead ends: 639 [2024-11-08 19:20:36,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:20:36,128 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:20:36,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:20:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-08 19:20:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 568. [2024-11-08 19:20:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 523 states have (on average 1.3173996175908222) internal successors, (689), 523 states have internal predecessors, (689), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:20:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 767 transitions. [2024-11-08 19:20:36,191 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 767 transitions. Word has length 100 [2024-11-08 19:20:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:20:36,191 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 767 transitions. [2024-11-08 19:20:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:20:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 767 transitions. [2024-11-08 19:20:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:20:36,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:20:36,193 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:20:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 19:20:36,194 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:20:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:20:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1341132261, now seen corresponding path program 1 times [2024-11-08 19:20:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:20:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190359521] [2024-11-08 19:20:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:20:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:20:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:21:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:21:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:21:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:21:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:21:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:21:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:21:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190359521] [2024-11-08 19:21:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190359521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:21:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623254794] [2024-11-08 19:21:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:47,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:21:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:21:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:21:47,889 INFO L87 Difference]: Start difference. First operand 568 states and 767 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:21:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:21:51,186 INFO L93 Difference]: Finished difference Result 743 states and 974 transitions. [2024-11-08 19:21:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:21:51,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 100 [2024-11-08 19:21:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:21:51,189 INFO L225 Difference]: With dead ends: 743 [2024-11-08 19:21:51,189 INFO L226 Difference]: Without dead ends: 741 [2024-11-08 19:21:51,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:21:51,190 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 345 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:21:51,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 549 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 19:21:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-08 19:21:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 589. [2024-11-08 19:21:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 544 states have (on average 1.318014705882353) internal successors, (717), 544 states have internal predecessors, (717), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:21:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 795 transitions. [2024-11-08 19:21:51,254 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 795 transitions. Word has length 100 [2024-11-08 19:21:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:21:51,255 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 795 transitions. [2024-11-08 19:21:51,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:21:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 795 transitions. [2024-11-08 19:21:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:21:51,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:21:51,257 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:21:51,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 19:21:51,258 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:21:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:21:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1782547791, now seen corresponding path program 1 times [2024-11-08 19:21:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:21:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905408896] [2024-11-08 19:21:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:21:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:21:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:21:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:21:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:21:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:21:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:21:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:21:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:21:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:21:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:21:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:21:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:21:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:21:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:21:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:21:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:21:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:21:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905408896] [2024-11-08 19:21:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905408896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:21:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:21:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:21:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643942479] [2024-11-08 19:21:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:21:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:21:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:21:57,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:21:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:21:57,205 INFO L87 Difference]: Start difference. First operand 589 states and 795 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:00,481 INFO L93 Difference]: Finished difference Result 1205 states and 1642 transitions. [2024-11-08 19:22:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:22:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-08 19:22:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:00,485 INFO L225 Difference]: With dead ends: 1205 [2024-11-08 19:22:00,485 INFO L226 Difference]: Without dead ends: 975 [2024-11-08 19:22:00,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:22:00,486 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 320 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:00,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 382 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 19:22:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-08 19:22:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 593. [2024-11-08 19:22:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 548 states have (on average 1.3193430656934306) internal successors, (723), 548 states have internal predecessors, (723), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 801 transitions. [2024-11-08 19:22:00,546 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 801 transitions. Word has length 100 [2024-11-08 19:22:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:00,547 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 801 transitions. [2024-11-08 19:22:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 801 transitions. [2024-11-08 19:22:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:22:00,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:00,549 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:00,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 19:22:00,549 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:00,550 INFO L85 PathProgramCache]: Analyzing trace with hash -7540429, now seen corresponding path program 1 times [2024-11-08 19:22:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289985727] [2024-11-08 19:22:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289985727] [2024-11-08 19:22:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289985727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:14,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:22:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125174064] [2024-11-08 19:22:14,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:14,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:22:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:22:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:22:14,271 INFO L87 Difference]: Start difference. First operand 593 states and 801 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:20,058 INFO L93 Difference]: Finished difference Result 949 states and 1286 transitions. [2024-11-08 19:22:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:22:20,059 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-08 19:22:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:20,063 INFO L225 Difference]: With dead ends: 949 [2024-11-08 19:22:20,063 INFO L226 Difference]: Without dead ends: 701 [2024-11-08 19:22:20,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2024-11-08 19:22:20,065 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 222 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:20,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 519 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 19:22:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-08 19:22:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 585. [2024-11-08 19:22:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 540 states have (on average 1.3166666666666667) internal successors, (711), 540 states have internal predecessors, (711), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 789 transitions. [2024-11-08 19:22:20,128 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 789 transitions. Word has length 100 [2024-11-08 19:22:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 789 transitions. [2024-11-08 19:22:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 789 transitions. [2024-11-08 19:22:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 19:22:20,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:20,131 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 19:22:20,132 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 672517941, now seen corresponding path program 1 times [2024-11-08 19:22:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614382154] [2024-11-08 19:22:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614382154] [2024-11-08 19:22:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614382154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:22:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91705664] [2024-11-08 19:22:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:22:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:25,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:22:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:22:25,315 INFO L87 Difference]: Start difference. First operand 585 states and 789 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:28,872 INFO L93 Difference]: Finished difference Result 1018 states and 1388 transitions. [2024-11-08 19:22:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:22:28,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-08 19:22:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:28,876 INFO L225 Difference]: With dead ends: 1018 [2024-11-08 19:22:28,877 INFO L226 Difference]: Without dead ends: 784 [2024-11-08 19:22:28,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:22:28,878 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 198 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:28,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 571 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 19:22:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-08 19:22:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 557. [2024-11-08 19:22:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 512 states have (on average 1.314453125) internal successors, (673), 512 states have internal predecessors, (673), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 751 transitions. [2024-11-08 19:22:28,952 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 751 transitions. Word has length 100 [2024-11-08 19:22:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:28,953 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 751 transitions. [2024-11-08 19:22:28,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 751 transitions. [2024-11-08 19:22:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:22:28,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:28,955 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 19:22:28,955 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -292306157, now seen corresponding path program 1 times [2024-11-08 19:22:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609736902] [2024-11-08 19:22:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609736902] [2024-11-08 19:22:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609736902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:29,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:29,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:22:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903749248] [2024-11-08 19:22:29,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:29,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:22:29,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:29,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:22:29,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:22:29,443 INFO L87 Difference]: Start difference. First operand 557 states and 751 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:30,069 INFO L93 Difference]: Finished difference Result 837 states and 1140 transitions. [2024-11-08 19:22:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:22:30,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-11-08 19:22:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:30,072 INFO L225 Difference]: With dead ends: 837 [2024-11-08 19:22:30,073 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 19:22:30,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:22:30,074 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 151 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:30,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 332 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:22:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 19:22:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 555. [2024-11-08 19:22:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 510 states have (on average 1.307843137254902) internal successors, (667), 510 states have internal predecessors, (667), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 745 transitions. [2024-11-08 19:22:30,139 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 745 transitions. Word has length 101 [2024-11-08 19:22:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:30,140 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 745 transitions. [2024-11-08 19:22:30,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 745 transitions. [2024-11-08 19:22:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:22:30,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:30,142 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 19:22:30,143 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:30,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1620553579, now seen corresponding path program 1 times [2024-11-08 19:22:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36100560] [2024-11-08 19:22:30,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36100560] [2024-11-08 19:22:30,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36100560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:30,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:30,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:22:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374228182] [2024-11-08 19:22:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:30,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:22:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:30,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:22:30,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:22:30,554 INFO L87 Difference]: Start difference. First operand 555 states and 745 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:31,321 INFO L93 Difference]: Finished difference Result 895 states and 1206 transitions. [2024-11-08 19:22:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:22:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-11-08 19:22:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:31,325 INFO L225 Difference]: With dead ends: 895 [2024-11-08 19:22:31,325 INFO L226 Difference]: Without dead ends: 584 [2024-11-08 19:22:31,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:22:31,326 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:31,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 393 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:22:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-08 19:22:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 554. [2024-11-08 19:22:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 509 states have (on average 1.306483300589391) internal successors, (665), 509 states have internal predecessors, (665), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 743 transitions. [2024-11-08 19:22:31,367 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 743 transitions. Word has length 101 [2024-11-08 19:22:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:31,368 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 743 transitions. [2024-11-08 19:22:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 743 transitions. [2024-11-08 19:22:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:22:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:31,371 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 19:22:31,372 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -917352040, now seen corresponding path program 1 times [2024-11-08 19:22:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712698346] [2024-11-08 19:22:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:31,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:31,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712698346] [2024-11-08 19:22:31,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712698346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:22:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520346269] [2024-11-08 19:22:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:22:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:22:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:22:31,477 INFO L87 Difference]: Start difference. First operand 554 states and 743 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:31,640 INFO L93 Difference]: Finished difference Result 923 states and 1265 transitions. [2024-11-08 19:22:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:22:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2024-11-08 19:22:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:31,643 INFO L225 Difference]: With dead ends: 923 [2024-11-08 19:22:31,643 INFO L226 Difference]: Without dead ends: 613 [2024-11-08 19:22:31,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:22:31,645 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:31,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:22:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-08 19:22:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 521. [2024-11-08 19:22:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 476 states have (on average 1.3298319327731092) internal successors, (633), 476 states have internal predecessors, (633), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 711 transitions. [2024-11-08 19:22:31,701 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 711 transitions. Word has length 103 [2024-11-08 19:22:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:31,702 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 711 transitions. [2024-11-08 19:22:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 711 transitions. [2024-11-08 19:22:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 19:22:31,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:31,704 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:31,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 19:22:31,705 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash -930523954, now seen corresponding path program 1 times [2024-11-08 19:22:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:31,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824418282] [2024-11-08 19:22:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824418282] [2024-11-08 19:22:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824418282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:22:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755984011] [2024-11-08 19:22:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:22:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:22:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:22:32,026 INFO L87 Difference]: Start difference. First operand 521 states and 711 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:32,613 INFO L93 Difference]: Finished difference Result 936 states and 1275 transitions. [2024-11-08 19:22:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:22:32,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-11-08 19:22:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:32,618 INFO L225 Difference]: With dead ends: 936 [2024-11-08 19:22:32,618 INFO L226 Difference]: Without dead ends: 636 [2024-11-08 19:22:32,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:22:32,620 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 106 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:32,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 434 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:22:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-08 19:22:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 558. [2024-11-08 19:22:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 513 states have (on average 1.3216374269005848) internal successors, (678), 513 states have internal predecessors, (678), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 756 transitions. [2024-11-08 19:22:32,678 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 756 transitions. Word has length 104 [2024-11-08 19:22:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:32,679 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 756 transitions. [2024-11-08 19:22:32,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 756 transitions. [2024-11-08 19:22:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 19:22:32,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:32,680 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:32,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 19:22:32,680 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:32,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1163787046, now seen corresponding path program 1 times [2024-11-08 19:22:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894360253] [2024-11-08 19:22:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894360253] [2024-11-08 19:22:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894360253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:22:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287810355] [2024-11-08 19:22:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:33,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:22:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:22:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:22:33,034 INFO L87 Difference]: Start difference. First operand 558 states and 756 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:33,640 INFO L93 Difference]: Finished difference Result 946 states and 1284 transitions. [2024-11-08 19:22:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:22:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 104 [2024-11-08 19:22:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:33,644 INFO L225 Difference]: With dead ends: 946 [2024-11-08 19:22:33,644 INFO L226 Difference]: Without dead ends: 638 [2024-11-08 19:22:33,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:22:33,645 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 116 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:33,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 441 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:22:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-08 19:22:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 545. [2024-11-08 19:22:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 500 states have (on average 1.318) internal successors, (659), 500 states have internal predecessors, (659), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 737 transitions. [2024-11-08 19:22:33,688 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 737 transitions. Word has length 104 [2024-11-08 19:22:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:33,688 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 737 transitions. [2024-11-08 19:22:33,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 737 transitions. [2024-11-08 19:22:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:22:33,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:33,690 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:33,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 19:22:33,690 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1772384349, now seen corresponding path program 1 times [2024-11-08 19:22:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16246412] [2024-11-08 19:22:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16246412] [2024-11-08 19:22:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16246412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:33,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:33,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:22:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321932854] [2024-11-08 19:22:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:33,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:22:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:22:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:22:33,982 INFO L87 Difference]: Start difference. First operand 545 states and 737 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:34,342 INFO L93 Difference]: Finished difference Result 879 states and 1204 transitions. [2024-11-08 19:22:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:22:34,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2024-11-08 19:22:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:34,346 INFO L225 Difference]: With dead ends: 879 [2024-11-08 19:22:34,346 INFO L226 Difference]: Without dead ends: 536 [2024-11-08 19:22:34,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:22:34,347 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:34,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 276 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:22:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-08 19:22:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 502. [2024-11-08 19:22:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 457 states have (on average 1.3260393873085339) internal successors, (606), 457 states have internal predecessors, (606), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2024-11-08 19:22:34,390 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 107 [2024-11-08 19:22:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:34,390 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2024-11-08 19:22:34,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2024-11-08 19:22:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:22:34,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:34,392 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 19:22:34,392 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash -890011396, now seen corresponding path program 1 times [2024-11-08 19:22:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572766239] [2024-11-08 19:22:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:22:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:22:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:22:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:22:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:22:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:22:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:22:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:22:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:22:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:22:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:22:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:22:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:22:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:22:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:22:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:22:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572766239] [2024-11-08 19:22:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572766239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:22:37,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:22:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:22:37,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740171825] [2024-11-08 19:22:37,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:22:37,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:22:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:22:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:22:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:22:37,818 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:22:39,507 INFO L93 Difference]: Finished difference Result 882 states and 1202 transitions. [2024-11-08 19:22:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:22:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2024-11-08 19:22:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:22:39,510 INFO L225 Difference]: With dead ends: 882 [2024-11-08 19:22:39,510 INFO L226 Difference]: Without dead ends: 582 [2024-11-08 19:22:39,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:22:39,511 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 230 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:22:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 443 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 19:22:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-08 19:22:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 524. [2024-11-08 19:22:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 479 states have (on average 1.3110647181628392) internal successors, (628), 479 states have internal predecessors, (628), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:22:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 706 transitions. [2024-11-08 19:22:39,563 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 706 transitions. Word has length 107 [2024-11-08 19:22:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:22:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 706 transitions. [2024-11-08 19:22:39,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:22:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 706 transitions. [2024-11-08 19:22:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:22:39,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:22:39,565 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:22:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 19:22:39,565 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:22:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:22:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1911079750, now seen corresponding path program 1 times [2024-11-08 19:22:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:22:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053458972] [2024-11-08 19:22:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:22:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:22:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:23:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:23:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:23:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:23:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:23:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:23:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:23:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:23:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:23:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:23:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:23:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:23:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:23:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:23:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:54,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053458972] [2024-11-08 19:23:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053458972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:54,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 19:23:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310703324] [2024-11-08 19:23:54,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:54,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 19:23:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 19:23:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:23:54,760 INFO L87 Difference]: Start difference. First operand 524 states and 706 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:23:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:23:58,674 INFO L93 Difference]: Finished difference Result 695 states and 896 transitions. [2024-11-08 19:23:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:23:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-11-08 19:23:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:23:58,677 INFO L225 Difference]: With dead ends: 695 [2024-11-08 19:23:58,677 INFO L226 Difference]: Without dead ends: 693 [2024-11-08 19:23:58,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:23:58,679 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 323 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:23:58,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 615 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 19:23:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-08 19:23:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 547. [2024-11-08 19:23:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 502 states have (on average 1.3087649402390438) internal successors, (657), 502 states have internal predecessors, (657), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:23:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 735 transitions. [2024-11-08 19:23:58,723 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 735 transitions. Word has length 107 [2024-11-08 19:23:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:23:58,723 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 735 transitions. [2024-11-08 19:23:58,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:23:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 735 transitions. [2024-11-08 19:23:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:23:58,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:58,724 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:58,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 19:23:58,725 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1849040136, now seen corresponding path program 1 times [2024-11-08 19:23:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597653111] [2024-11-08 19:23:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:25:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:25:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:25:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:25:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:25:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:25:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:25:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:25:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:25:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:25:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:25:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:25:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597653111] [2024-11-08 19:25:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597653111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:10,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:10,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 19:25:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878261999] [2024-11-08 19:25:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:25:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:25:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:25:10,538 INFO L87 Difference]: Start difference. First operand 547 states and 735 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:20,834 INFO L93 Difference]: Finished difference Result 739 states and 945 transitions. [2024-11-08 19:25:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 19:25:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2024-11-08 19:25:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:20,836 INFO L225 Difference]: With dead ends: 739 [2024-11-08 19:25:20,836 INFO L226 Difference]: Without dead ends: 737 [2024-11-08 19:25:20,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 19:25:20,837 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 306 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:20,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 610 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 19:25:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-08 19:25:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 569. [2024-11-08 19:25:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 524 states have (on average 1.3034351145038168) internal successors, (683), 524 states have internal predecessors, (683), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:25:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 761 transitions. [2024-11-08 19:25:20,903 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 761 transitions. Word has length 107 [2024-11-08 19:25:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:20,903 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 761 transitions. [2024-11-08 19:25:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 761 transitions. [2024-11-08 19:25:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:25:20,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:20,905 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:20,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 19:25:20,905 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2066322882, now seen corresponding path program 1 times [2024-11-08 19:25:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:20,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968271818] [2024-11-08 19:25:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:25:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:25:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:25:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:25:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:25:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:25:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:25:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:25:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:25:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:25:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:25:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:25:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968271818] [2024-11-08 19:25:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968271818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:25:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030340030] [2024-11-08 19:25:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:21,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:25:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:25:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:25:21,688 INFO L87 Difference]: Start difference. First operand 569 states and 761 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:23,485 INFO L93 Difference]: Finished difference Result 997 states and 1332 transitions. [2024-11-08 19:25:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:25:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2024-11-08 19:25:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:23,494 INFO L225 Difference]: With dead ends: 997 [2024-11-08 19:25:23,495 INFO L226 Difference]: Without dead ends: 685 [2024-11-08 19:25:23,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:25:23,496 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 143 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:23,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 707 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 19:25:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-08 19:25:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 565. [2024-11-08 19:25:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 520 states have (on average 1.301923076923077) internal successors, (677), 520 states have internal predecessors, (677), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:25:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 755 transitions. [2024-11-08 19:25:23,588 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 755 transitions. Word has length 107 [2024-11-08 19:25:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:23,589 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 755 transitions. [2024-11-08 19:25:23,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 755 transitions. [2024-11-08 19:25:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:25:23,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:23,594 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 19:25:23,594 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:23,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1672315176, now seen corresponding path program 1 times [2024-11-08 19:25:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010570571] [2024-11-08 19:25:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:26:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:26:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 19:26:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:26:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 19:26:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:26:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:26:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:26:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:26:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:26:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:26:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:26:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 19:26:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:26:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:26:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010570571] [2024-11-08 19:26:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010570571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:26:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:26:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 19:26:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933665939] [2024-11-08 19:26:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:26:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:26:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:26:26,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:26:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:26:26,723 INFO L87 Difference]: Start difference. First operand 565 states and 755 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:26:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:26:32,234 INFO L93 Difference]: Finished difference Result 659 states and 854 transitions. [2024-11-08 19:26:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 19:26:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-08 19:26:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:26:32,237 INFO L225 Difference]: With dead ends: 659 [2024-11-08 19:26:32,238 INFO L226 Difference]: Without dead ends: 657 [2024-11-08 19:26:32,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 19:26:32,239 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 344 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:26:32,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 832 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 19:26:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-08 19:26:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 565. [2024-11-08 19:26:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 520 states have (on average 1.301923076923077) internal successors, (677), 520 states have internal predecessors, (677), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 19:26:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 755 transitions. [2024-11-08 19:26:32,311 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 755 transitions. Word has length 108 [2024-11-08 19:26:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:26:32,312 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 755 transitions. [2024-11-08 19:26:32,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:26:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 755 transitions. [2024-11-08 19:26:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:26:32,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:26:32,314 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:26:32,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 19:26:32,314 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:26:32,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:26:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 250912858, now seen corresponding path program 1 times [2024-11-08 19:26:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:26:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885658613] [2024-11-08 19:26:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:26:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat