./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC --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 82629eca6c71a457570e41243c2aaef9825ffa804906408a105aaa7b8cd16d36 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:03:54,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:03:55,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:03:55,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:03:55,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:03:55,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:03:55,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:03:55,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:03:55,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:03:55,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:03:55,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:03:55,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:03:55,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:03:55,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:03:55,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:03:55,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:03:55,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:03:55,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:03:55,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:03:55,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:03:55,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:03:55,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:03:55,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:03:55,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:03:55,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:03:55,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:03:55,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:03:55,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:03:55,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:03:55,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:03:55,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:03:55,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC 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 -> 82629eca6c71a457570e41243c2aaef9825ffa804906408a105aaa7b8cd16d36 [2024-11-24 00:03:55,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:03:55,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:03:55,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:03:55,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:03:55,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:03:55,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-24 00:03:58,505 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/data/d29cac01b/4045a0995ef446d5862aff72cb6265f8/FLAG04c9c3edf [2024-11-24 00:03:59,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:03:59,241 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-24 00:03:59,291 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/data/d29cac01b/4045a0995ef446d5862aff72cb6265f8/FLAG04c9c3edf [2024-11-24 00:03:59,315 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/data/d29cac01b/4045a0995ef446d5862aff72cb6265f8 [2024-11-24 00:03:59,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:03:59,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:03:59,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:03:59,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:03:59,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:03:59,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:03:59" (1/1) ... [2024-11-24 00:03:59,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6845e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:03:59, skipping insertion in model container [2024-11-24 00:03:59,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:03:59" (1/1) ... [2024-11-24 00:03:59,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:03:59,861 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_b22d787a-d828-472a-99f7-b14561446732/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c[26888,26901] [2024-11-24 00:03:59,954 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_b22d787a-d828-472a-99f7-b14561446732/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c[33949,33962] [2024-11-24 00:04:00,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:04:00,760 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:04:00,843 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_b22d787a-d828-472a-99f7-b14561446732/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c[26888,26901] [2024-11-24 00:04:00,863 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_b22d787a-d828-472a-99f7-b14561446732/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c[33949,33962] [2024-11-24 00:04:01,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:04:01,417 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:04:01,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01 WrapperNode [2024-11-24 00:04:01,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:04:01,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:04:01,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:04:01,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:04:01,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:01,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:01,880 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5289 [2024-11-24 00:04:01,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:04:01,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:04:01,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:04:01,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:04:01,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:01,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:01,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,277 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-24 00:04:02,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:04:02,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:04:02,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:04:02,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:04:02,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (1/1) ... [2024-11-24 00:04:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:04:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:04:02,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:04:02,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b22d787a-d828-472a-99f7-b14561446732/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:04:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:04:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:04:02,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:04:02,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:04:02,906 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:04:02,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:04:09,324 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-24 00:04:09,324 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:04:09,375 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:04:09,376 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-24 00:04:09,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:04:09 BoogieIcfgContainer [2024-11-24 00:04:09,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:04:09,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:04:09,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:04:09,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:04:09,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:03:59" (1/3) ... [2024-11-24 00:04:09,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba37fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:04:09, skipping insertion in model container [2024-11-24 00:04:09,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:04:01" (2/3) ... [2024-11-24 00:04:09,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba37fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:04:09, skipping insertion in model container [2024-11-24 00:04:09,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:04:09" (3/3) ... [2024-11-24 00:04:09,388 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-24 00:04:09,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:04:09,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 949 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-24 00:04:09,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:04:09,536 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;@18666a48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:04:09,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-24 00:04:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-24 00:04:09,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:09,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-24 00:04:09,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:09,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1967767115, now seen corresponding path program 1 times [2024-11-24 00:04:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:09,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32387429] [2024-11-24 00:04:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:09,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32387429] [2024-11-24 00:04:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32387429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:04:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438114568] [2024-11-24 00:04:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:04:10,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:10,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:04:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:04:10,032 INFO L87 Difference]: Start difference. First operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:10,145 INFO L93 Difference]: Finished difference Result 1829 states and 3468 transitions. [2024-11-24 00:04:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:04:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-24 00:04:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:10,167 INFO L225 Difference]: With dead ends: 1829 [2024-11-24 00:04:10,167 INFO L226 Difference]: Without dead ends: 883 [2024-11-24 00:04:10,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-24 00:04:10,176 INFO L435 NwaCegarLoop]: 1731 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, 1731 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-24 00:04:10,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-24 00:04:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-24 00:04:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2024-11-24 00:04:10,287 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2024-11-24 00:04:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:10,288 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2024-11-24 00:04:10,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2024-11-24 00:04:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-24 00:04:10,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:10,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-24 00:04:10,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:04:10,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:10,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2101780621, now seen corresponding path program 1 times [2024-11-24 00:04:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:10,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431355619] [2024-11-24 00:04:10,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431355619] [2024-11-24 00:04:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431355619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:04:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762607032] [2024-11-24 00:04:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:10,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:04:10,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:10,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:04:10,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:04:10,741 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:10,979 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2024-11-24 00:04:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:04:10,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-24 00:04:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:10,985 INFO L225 Difference]: With dead ends: 949 [2024-11-24 00:04:10,989 INFO L226 Difference]: Without dead ends: 883 [2024-11-24 00:04:10,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:04:10,990 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:10,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:04:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-24 00:04:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-24 00:04:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2024-11-24 00:04:11,038 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2024-11-24 00:04:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2024-11-24 00:04:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2024-11-24 00:04:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-24 00:04:11,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:11,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:04:11,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash 693610123, now seen corresponding path program 1 times [2024-11-24 00:04:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692757334] [2024-11-24 00:04:11,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:11,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692757334] [2024-11-24 00:04:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692757334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:11,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:04:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032435175] [2024-11-24 00:04:11,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:11,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:11,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:11,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:11,259 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:16,290 INFO L93 Difference]: Finished difference Result 2387 states and 4479 transitions. [2024-11-24 00:04:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:16,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-24 00:04:16,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:16,302 INFO L225 Difference]: With dead ends: 2387 [2024-11-24 00:04:16,303 INFO L226 Difference]: Without dead ends: 1634 [2024-11-24 00:04:16,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 00:04:16,306 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 921 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:16,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 244 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-24 00:04:16,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-24 00:04:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-24 00:04:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.826593137254902) internal successors, (2981), 1633 states have internal predecessors, (2981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2981 transitions. [2024-11-24 00:04:16,390 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2981 transitions. Word has length 61 [2024-11-24 00:04:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:16,391 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2981 transitions. [2024-11-24 00:04:16,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2981 transitions. [2024-11-24 00:04:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-24 00:04:16,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:16,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:16,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:04:16,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:16,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1651582301, now seen corresponding path program 1 times [2024-11-24 00:04:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491533572] [2024-11-24 00:04:16,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:17,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:17,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491533572] [2024-11-24 00:04:17,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491533572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:17,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:17,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:04:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539980525] [2024-11-24 00:04:17,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:17,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:04:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:17,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:04:17,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:04:17,005 INFO L87 Difference]: Start difference. First operand 1634 states and 2981 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:17,718 INFO L93 Difference]: Finished difference Result 2626 states and 4581 transitions. [2024-11-24 00:04:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-24 00:04:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-24 00:04:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:17,733 INFO L225 Difference]: With dead ends: 2626 [2024-11-24 00:04:17,733 INFO L226 Difference]: Without dead ends: 2564 [2024-11-24 00:04:17,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:04:17,736 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13578 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13578 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:17,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13578 Valid, 5575 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 00:04:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-24 00:04:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1694. [2024-11-24 00:04:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1692 states have (on average 1.8191489361702127) internal successors, (3078), 1693 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 3078 transitions. [2024-11-24 00:04:17,800 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 3078 transitions. Word has length 90 [2024-11-24 00:04:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:17,800 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 3078 transitions. [2024-11-24 00:04:17,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3078 transitions. [2024-11-24 00:04:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 00:04:17,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:17,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:17,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:04:17,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 551619955, now seen corresponding path program 1 times [2024-11-24 00:04:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203225709] [2024-11-24 00:04:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203225709] [2024-11-24 00:04:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203225709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:17,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710165103] [2024-11-24 00:04:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:17,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:17,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:17,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:17,979 INFO L87 Difference]: Start difference. First operand 1694 states and 3078 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:18,036 INFO L93 Difference]: Finished difference Result 1927 states and 3453 transitions. [2024-11-24 00:04:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-24 00:04:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:18,045 INFO L225 Difference]: With dead ends: 1927 [2024-11-24 00:04:18,045 INFO L226 Difference]: Without dead ends: 1805 [2024-11-24 00:04:18,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:18,048 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:18,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-11-24 00:04:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1801. [2024-11-24 00:04:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.8054474708171206) internal successors, (3248), 1800 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 3248 transitions. [2024-11-24 00:04:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 3248 transitions. Word has length 92 [2024-11-24 00:04:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:18,104 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 3248 transitions. [2024-11-24 00:04:18,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 3248 transitions. [2024-11-24 00:04:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-24 00:04:18,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:18,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:18,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:04:18,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash 618113467, now seen corresponding path program 1 times [2024-11-24 00:04:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:18,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130196508] [2024-11-24 00:04:18,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130196508] [2024-11-24 00:04:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130196508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:18,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:04:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560354009] [2024-11-24 00:04:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:04:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:18,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:04:18,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:04:18,836 INFO L87 Difference]: Start difference. First operand 1801 states and 3248 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:19,434 INFO L93 Difference]: Finished difference Result 2032 states and 3616 transitions. [2024-11-24 00:04:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:04:19,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-24 00:04:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:19,442 INFO L225 Difference]: With dead ends: 2032 [2024-11-24 00:04:19,442 INFO L226 Difference]: Without dead ends: 1803 [2024-11-24 00:04:19,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:04:19,443 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 10647 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10647 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:19,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10647 Valid, 2278 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:04:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-24 00:04:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2024-11-24 00:04:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.8043357420789328) internal successors, (3246), 1800 states have internal predecessors, (3246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:19,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 3246 transitions. [2024-11-24 00:04:19,495 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 3246 transitions. Word has length 92 [2024-11-24 00:04:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:19,496 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 3246 transitions. [2024-11-24 00:04:19,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 3246 transitions. [2024-11-24 00:04:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-24 00:04:19,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:19,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:19,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:04:19,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1566925479, now seen corresponding path program 1 times [2024-11-24 00:04:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57087394] [2024-11-24 00:04:19,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57087394] [2024-11-24 00:04:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57087394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:04:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685745491] [2024-11-24 00:04:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:04:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:19,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:04:19,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:04:19,932 INFO L87 Difference]: Start difference. First operand 1801 states and 3246 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:19,984 INFO L93 Difference]: Finished difference Result 1809 states and 3255 transitions. [2024-11-24 00:04:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:04:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-24 00:04:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:19,993 INFO L225 Difference]: With dead ends: 1809 [2024-11-24 00:04:19,993 INFO L226 Difference]: Without dead ends: 1807 [2024-11-24 00:04:19,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:04:19,994 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:19,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-24 00:04:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2024-11-24 00:04:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.8011080332409972) internal successors, (3251), 1806 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 3251 transitions. [2024-11-24 00:04:20,049 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 3251 transitions. Word has length 93 [2024-11-24 00:04:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:20,049 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 3251 transitions. [2024-11-24 00:04:20,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 3251 transitions. [2024-11-24 00:04:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:20,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:20,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:20,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:04:20,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:20,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -401487589, now seen corresponding path program 1 times [2024-11-24 00:04:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927205563] [2024-11-24 00:04:20,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:20,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927205563] [2024-11-24 00:04:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927205563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000630644] [2024-11-24 00:04:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:20,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:20,181 INFO L87 Difference]: Start difference. First operand 1807 states and 3251 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:20,225 INFO L93 Difference]: Finished difference Result 2261 states and 3963 transitions. [2024-11-24 00:04:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:20,233 INFO L225 Difference]: With dead ends: 2261 [2024-11-24 00:04:20,233 INFO L226 Difference]: Without dead ends: 2026 [2024-11-24 00:04:20,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:20,237 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:20,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-11-24 00:04:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2024-11-24 00:04:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2022 states have (on average 1.774480712166172) internal successors, (3588), 2023 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3588 transitions. [2024-11-24 00:04:20,300 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3588 transitions. Word has length 94 [2024-11-24 00:04:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:20,300 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3588 transitions. [2024-11-24 00:04:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3588 transitions. [2024-11-24 00:04:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:20,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:20,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:04:20,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1540581915, now seen corresponding path program 1 times [2024-11-24 00:04:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:20,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795116882] [2024-11-24 00:04:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:20,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795116882] [2024-11-24 00:04:20,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795116882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:20,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047680422] [2024-11-24 00:04:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:20,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:20,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:20,425 INFO L87 Difference]: Start difference. First operand 2024 states and 3588 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:20,479 INFO L93 Difference]: Finished difference Result 2896 states and 4946 transitions. [2024-11-24 00:04:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:20,489 INFO L225 Difference]: With dead ends: 2896 [2024-11-24 00:04:20,489 INFO L226 Difference]: Without dead ends: 2444 [2024-11-24 00:04:20,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:20,491 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:20,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2024-11-24 00:04:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2024-11-24 00:04:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.7336065573770492) internal successors, (4230), 2441 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 4230 transitions. [2024-11-24 00:04:20,567 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 4230 transitions. Word has length 94 [2024-11-24 00:04:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:20,568 INFO L471 AbstractCegarLoop]: Abstraction has 2442 states and 4230 transitions. [2024-11-24 00:04:20,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 4230 transitions. [2024-11-24 00:04:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:20,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:20,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:04:20,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1967352859, now seen corresponding path program 1 times [2024-11-24 00:04:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946062208] [2024-11-24 00:04:20,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:20,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:20,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946062208] [2024-11-24 00:04:20,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946062208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:20,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:20,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587714242] [2024-11-24 00:04:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:20,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:20,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:20,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:20,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:20,687 INFO L87 Difference]: Start difference. First operand 2442 states and 4230 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:20,752 INFO L93 Difference]: Finished difference Result 4118 states and 6816 transitions. [2024-11-24 00:04:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:20,764 INFO L225 Difference]: With dead ends: 4118 [2024-11-24 00:04:20,764 INFO L226 Difference]: Without dead ends: 3248 [2024-11-24 00:04:20,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:20,766 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:20,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2024-11-24 00:04:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3246. [2024-11-24 00:04:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3244 states have (on average 1.6800246609124538) internal successors, (5450), 3245 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5450 transitions. [2024-11-24 00:04:20,874 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5450 transitions. Word has length 94 [2024-11-24 00:04:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:20,874 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 5450 transitions. [2024-11-24 00:04:20,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5450 transitions. [2024-11-24 00:04:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:20,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:20,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:20,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:04:20,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1089352421, now seen corresponding path program 1 times [2024-11-24 00:04:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:20,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929464585] [2024-11-24 00:04:20,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929464585] [2024-11-24 00:04:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929464585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714735221] [2024-11-24 00:04:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:20,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:20,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:20,996 INFO L87 Difference]: Start difference. First operand 3246 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:21,106 INFO L93 Difference]: Finished difference Result 6466 states and 10364 transitions. [2024-11-24 00:04:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:21,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:21,129 INFO L225 Difference]: With dead ends: 6466 [2024-11-24 00:04:21,129 INFO L226 Difference]: Without dead ends: 4792 [2024-11-24 00:04:21,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:21,132 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:21,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2024-11-24 00:04:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4790. [2024-11-24 00:04:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4790 states, 4788 states have (on average 1.6211361737677528) internal successors, (7762), 4789 states have internal predecessors, (7762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 7762 transitions. [2024-11-24 00:04:21,302 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 7762 transitions. Word has length 94 [2024-11-24 00:04:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:21,302 INFO L471 AbstractCegarLoop]: Abstraction has 4790 states and 7762 transitions. [2024-11-24 00:04:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 7762 transitions. [2024-11-24 00:04:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:21,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:21,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:21,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:04:21,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:21,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1523888357, now seen corresponding path program 1 times [2024-11-24 00:04:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:21,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252735171] [2024-11-24 00:04:21,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252735171] [2024-11-24 00:04:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252735171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535922748] [2024-11-24 00:04:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:21,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:21,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:21,412 INFO L87 Difference]: Start difference. First operand 4790 states and 7762 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:21,580 INFO L93 Difference]: Finished difference Result 10970 states and 17076 transitions. [2024-11-24 00:04:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:21,611 INFO L225 Difference]: With dead ends: 10970 [2024-11-24 00:04:21,611 INFO L226 Difference]: Without dead ends: 7752 [2024-11-24 00:04:21,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:21,617 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:21,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2024-11-24 00:04:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7750. [2024-11-24 00:04:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7750 states, 7748 states have (on average 1.5655653071760454) internal successors, (12130), 7749 states have internal predecessors, (12130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7750 states to 7750 states and 12130 transitions. [2024-11-24 00:04:21,963 INFO L78 Accepts]: Start accepts. Automaton has 7750 states and 12130 transitions. Word has length 94 [2024-11-24 00:04:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 7750 states and 12130 transitions. [2024-11-24 00:04:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7750 states and 12130 transitions. [2024-11-24 00:04:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:21,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:21,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:21,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:04:21,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 990146075, now seen corresponding path program 1 times [2024-11-24 00:04:21,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:21,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975573767] [2024-11-24 00:04:21,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:22,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975573767] [2024-11-24 00:04:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975573767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080154006] [2024-11-24 00:04:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:22,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:22,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:22,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:22,067 INFO L87 Difference]: Start difference. First operand 7750 states and 12130 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:22,312 INFO L93 Difference]: Finished difference Result 19594 states and 29732 transitions. [2024-11-24 00:04:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:22,373 INFO L225 Difference]: With dead ends: 19594 [2024-11-24 00:04:22,373 INFO L226 Difference]: Without dead ends: 13416 [2024-11-24 00:04:22,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:22,394 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:22,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13416 states. [2024-11-24 00:04:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13416 to 13414. [2024-11-24 00:04:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13414 states, 13412 states have (on average 1.5175961825231137) internal successors, (20354), 13413 states have internal predecessors, (20354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13414 states to 13414 states and 20354 transitions. [2024-11-24 00:04:22,844 INFO L78 Accepts]: Start accepts. Automaton has 13414 states and 20354 transitions. Word has length 94 [2024-11-24 00:04:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:22,844 INFO L471 AbstractCegarLoop]: Abstraction has 13414 states and 20354 transitions. [2024-11-24 00:04:22,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13414 states and 20354 transitions. [2024-11-24 00:04:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-24 00:04:22,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:22,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:22,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:04:22,846 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:22,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1703496475, now seen corresponding path program 1 times [2024-11-24 00:04:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792628261] [2024-11-24 00:04:22,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792628261] [2024-11-24 00:04:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792628261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:22,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122595975] [2024-11-24 00:04:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:22,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:22,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:22,957 INFO L87 Difference]: Start difference. First operand 13414 states and 20354 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:23,573 INFO L93 Difference]: Finished difference Result 36074 states and 53508 transitions. [2024-11-24 00:04:23,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:23,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-24 00:04:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:23,642 INFO L225 Difference]: With dead ends: 36074 [2024-11-24 00:04:23,642 INFO L226 Difference]: Without dead ends: 24232 [2024-11-24 00:04:23,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:23,660 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:23,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24232 states. [2024-11-24 00:04:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24232 to 24230. [2024-11-24 00:04:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24230 states, 24228 states have (on average 1.4767211490837049) internal successors, (35778), 24229 states have internal predecessors, (35778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24230 states to 24230 states and 35778 transitions. [2024-11-24 00:04:24,468 INFO L78 Accepts]: Start accepts. Automaton has 24230 states and 35778 transitions. Word has length 94 [2024-11-24 00:04:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 24230 states and 35778 transitions. [2024-11-24 00:04:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 24230 states and 35778 transitions. [2024-11-24 00:04:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-24 00:04:24,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:24,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:24,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:04:24,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:24,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1087415530, now seen corresponding path program 1 times [2024-11-24 00:04:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126060364] [2024-11-24 00:04:24,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:04:24,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:24,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126060364] [2024-11-24 00:04:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126060364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:24,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:04:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031596829] [2024-11-24 00:04:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:24,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:04:24,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:24,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:04:24,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:04:24,585 INFO L87 Difference]: Start difference. First operand 24230 states and 35778 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:25,251 INFO L93 Difference]: Finished difference Result 47789 states and 70344 transitions. [2024-11-24 00:04:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:04:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-24 00:04:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:25,330 INFO L225 Difference]: With dead ends: 47789 [2024-11-24 00:04:25,330 INFO L226 Difference]: Without dead ends: 35242 [2024-11-24 00:04:25,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 00:04:25,348 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:25,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:04:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35242 states. [2024-11-24 00:04:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35242 to 35240. [2024-11-24 00:04:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35240 states, 35238 states have (on average 1.462171519382485) internal successors, (51524), 35239 states have internal predecessors, (51524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35240 states to 35240 states and 51524 transitions. [2024-11-24 00:04:26,399 INFO L78 Accepts]: Start accepts. Automaton has 35240 states and 51524 transitions. Word has length 96 [2024-11-24 00:04:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:26,400 INFO L471 AbstractCegarLoop]: Abstraction has 35240 states and 51524 transitions. [2024-11-24 00:04:26,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 35240 states and 51524 transitions. [2024-11-24 00:04:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 00:04:26,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:26,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:26,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:04:26,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 54573310, now seen corresponding path program 1 times [2024-11-24 00:04:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454714664] [2024-11-24 00:04:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 00:04:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454714664] [2024-11-24 00:04:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454714664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:04:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538601670] [2024-11-24 00:04:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:04:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:04:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:04:26,800 INFO L87 Difference]: Start difference. First operand 35240 states and 51524 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:31,842 INFO L93 Difference]: Finished difference Result 311354 states and 450125 transitions. [2024-11-24 00:04:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:04:31,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-24 00:04:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:32,464 INFO L225 Difference]: With dead ends: 311354 [2024-11-24 00:04:32,465 INFO L226 Difference]: Without dead ends: 277688 [2024-11-24 00:04:32,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-24 00:04:32,561 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11840 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11840 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:32,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11840 Valid, 4973 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:04:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277688 states. [2024-11-24 00:04:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277688 to 68904. [2024-11-24 00:04:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68904 states, 68902 states have (on average 1.4481437403848945) internal successors, (99780), 68903 states have internal predecessors, (99780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68904 states to 68904 states and 99780 transitions. [2024-11-24 00:04:36,904 INFO L78 Accepts]: Start accepts. Automaton has 68904 states and 99780 transitions. Word has length 119 [2024-11-24 00:04:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:36,905 INFO L471 AbstractCegarLoop]: Abstraction has 68904 states and 99780 transitions. [2024-11-24 00:04:36,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 68904 states and 99780 transitions. [2024-11-24 00:04:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 00:04:36,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:36,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:36,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:04:36,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642814, now seen corresponding path program 1 times [2024-11-24 00:04:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574639614] [2024-11-24 00:04:36,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-24 00:04:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574639614] [2024-11-24 00:04:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574639614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:04:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081369949] [2024-11-24 00:04:37,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:37,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:04:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:04:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:04:37,323 INFO L87 Difference]: Start difference. First operand 68904 states and 99780 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:04:44,650 INFO L93 Difference]: Finished difference Result 345018 states and 498381 transitions. [2024-11-24 00:04:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:04:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-24 00:04:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:04:45,020 INFO L225 Difference]: With dead ends: 345018 [2024-11-24 00:04:45,020 INFO L226 Difference]: Without dead ends: 311352 [2024-11-24 00:04:45,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-24 00:04:45,071 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11882 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11882 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:04:45,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11882 Valid, 4839 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-24 00:04:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311352 states. [2024-11-24 00:04:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311352 to 119464. [2024-11-24 00:04:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119464 states, 119462 states have (on average 1.4384825300095427) internal successors, (171844), 119463 states have internal predecessors, (171844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119464 states to 119464 states and 171844 transitions. [2024-11-24 00:04:50,255 INFO L78 Accepts]: Start accepts. Automaton has 119464 states and 171844 transitions. Word has length 119 [2024-11-24 00:04:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:04:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 119464 states and 171844 transitions. [2024-11-24 00:04:50,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:04:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 119464 states and 171844 transitions. [2024-11-24 00:04:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 00:04:50,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:04:50,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:50,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:04:50,265 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:04:50,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:04:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1871553538, now seen corresponding path program 1 times [2024-11-24 00:04:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:04:50,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093556371] [2024-11-24 00:04:50,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:04:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:04:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:04:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-24 00:04:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:04:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093556371] [2024-11-24 00:04:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093556371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:04:50,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:04:50,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:04:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204743269] [2024-11-24 00:04:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:04:50,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:04:50,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:04:50,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:04:50,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:04:50,638 INFO L87 Difference]: Start difference. First operand 119464 states and 171844 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)