./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 bf9b303f0455860ff73b360d674f9b56750c61e03c2589dbf0115b0e5bdacb76 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:02:24,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:02:24,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:02:24,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:02:24,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:02:24,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:02:24,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:02:24,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:02:24,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:02:24,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:02:24,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:02:24,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:02:24,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:02:24,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:02:24,529 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:02:24,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:02:24,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:02:24,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:02:24,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:02:24,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:02:24,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:02:24,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:02:24,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:02:24,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:02:24,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:02:24,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:02:24,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:02:24,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:02:24,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:02:24,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:02:24,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:02:24,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:02:24,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:02:24,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:02:24,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:02:24,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:02:24,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:02:24,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:02:24,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:02:24,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:02:24,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:02:24,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:02:24,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> bf9b303f0455860ff73b360d674f9b56750c61e03c2589dbf0115b0e5bdacb76 [2024-11-10 00:02:24,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:02:24,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:02:24,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:02:24,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:02:24,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:02:24,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-10 00:02:26,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:02:26,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:02:26,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-10 00:02:26,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe25b413d/d10ddeb2adb3400a931c35dbe8712aa6/FLAG73dd7c464 [2024-11-10 00:02:26,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe25b413d/d10ddeb2adb3400a931c35dbe8712aa6 [2024-11-10 00:02:26,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:02:26,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:02:26,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:02:26,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:02:26,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:02:26,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:26,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fc2f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26, skipping insertion in model container [2024-11-10 00:02:26,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:26,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:02:26,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[11904,11917] [2024-11-10 00:02:26,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:02:26,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:02:26,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c[11904,11917] [2024-11-10 00:02:26,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:02:26,905 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:02:26,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26 WrapperNode [2024-11-10 00:02:26,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:02:26,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:02:26,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:02:26,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:02:26,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:26,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:26,974 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1047 [2024-11-10 00:02:26,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:02:26,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:02:26,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:02:26,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:02:26,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:26,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,023 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-10 00:02:27,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:02:27,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:02:27,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:02:27,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:02:27,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (1/1) ... [2024-11-10 00:02:27,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:02:27,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:02:27,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:02:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:02:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:02:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:02:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:02:27,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:02:27,278 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:02:27,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:02:28,180 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node6__m6~0#1;havoc main_~node5__m5~0#1; [2024-11-10 00:02:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L466: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: havoc main_~node6____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L896: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node4__m4~0#1;havoc main_~node3__m3~0#1; [2024-11-10 00:02:28,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L436: havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:28,183 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L602: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1429: havoc main_~node4____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L273: havoc main_~node2__m2~0#1;havoc main_~node1__m1~0#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:28,184 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-10 00:02:28,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:28,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:28,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L572: havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1; [2024-11-10 00:02:28,185 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1564: havoc main_~node1____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc main_~init__tmp~0#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073: havoc main_~node5____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1339: havoc main_~node6____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1474: havoc main_~node3____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc main_~node6____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:28,188 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-10 00:02:28,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1118: havoc main_~node4____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1384: havoc main_~node5____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-10 00:02:28,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1519: havoc main_~node2____CPAchecker_TMP_0~2#1; [2024-11-10 00:02:28,189 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:02:28,243 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-10 00:02:28,244 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:02:28,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:02:28,260 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:02:28,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:02:28 BoogieIcfgContainer [2024-11-10 00:02:28,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:02:28,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:02:28,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:02:28,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:02:28,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:02:26" (1/3) ... [2024-11-10 00:02:28,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec0096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:02:28, skipping insertion in model container [2024-11-10 00:02:28,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:02:26" (2/3) ... [2024-11-10 00:02:28,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec0096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:02:28, skipping insertion in model container [2024-11-10 00:02:28,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:02:28" (3/3) ... [2024-11-10 00:02:28,269 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2024-11-10 00:02:28,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:02:28,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:02:28,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:02:28,349 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;@780813f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:02:28,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:02:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 301 states have (on average 1.5681063122923589) internal successors, (472), 302 states have internal predecessors, (472), 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-10 00:02:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:02:28,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:28,378 INFO L215 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] [2024-11-10 00:02:28,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:28,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1053607705, now seen corresponding path program 1 times [2024-11-10 00:02:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512807967] [2024-11-10 00:02:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:28,875 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-10 00:02:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512807967] [2024-11-10 00:02:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512807967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:02:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892202382] [2024-11-10 00:02:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:28,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:02:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:02:28,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:02:28,907 INFO L87 Difference]: Start difference. First operand has 303 states, 301 states have (on average 1.5681063122923589) internal successors, (472), 302 states have internal predecessors, (472), 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 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10 00:02:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:29,067 INFO L93 Difference]: Finished difference Result 564 states and 862 transitions. [2024-11-10 00:02:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:02:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2024-11-10 00:02:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:29,080 INFO L225 Difference]: With dead ends: 564 [2024-11-10 00:02:29,080 INFO L226 Difference]: Without dead ends: 299 [2024-11-10 00:02:29,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:02:29,086 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 151 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:29,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1235 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-10 00:02:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-11-10 00:02:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4161073825503356) internal successors, (422), 298 states have internal predecessors, (422), 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-10 00:02:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 422 transitions. [2024-11-10 00:02:29,126 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 422 transitions. Word has length 91 [2024-11-10 00:02:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 422 transitions. [2024-11-10 00:02:29,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-10 00:02:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 422 transitions. [2024-11-10 00:02:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 00:02:29,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:29,132 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:29,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:02:29,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:29,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1790448749, now seen corresponding path program 1 times [2024-11-10 00:02:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623910353] [2024-11-10 00:02:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:29,430 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-10 00:02:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623910353] [2024-11-10 00:02:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623910353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:29,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:29,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750539940] [2024-11-10 00:02:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:29,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:29,433 INFO L87 Difference]: Start difference. First operand 299 states and 422 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10 00:02:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:29,470 INFO L93 Difference]: Finished difference Result 632 states and 943 transitions. [2024-11-10 00:02:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 169 [2024-11-10 00:02:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:29,472 INFO L225 Difference]: With dead ends: 632 [2024-11-10 00:02:29,472 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 00:02:29,475 INFO L431 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-10 00:02:29,476 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 213 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:29,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 721 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 00:02:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2024-11-10 00:02:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4558472553699284) internal successors, (610), 419 states have internal predecessors, (610), 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-10 00:02:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 610 transitions. [2024-11-10 00:02:29,492 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 610 transitions. Word has length 169 [2024-11-10 00:02:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:29,492 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 610 transitions. [2024-11-10 00:02:29,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10 00:02:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 610 transitions. [2024-11-10 00:02:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 00:02:29,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:29,495 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:29,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:02:29,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:29,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash -643598065, now seen corresponding path program 1 times [2024-11-10 00:02:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881241770] [2024-11-10 00:02:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:29,620 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-10 00:02:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:29,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881241770] [2024-11-10 00:02:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881241770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845397577] [2024-11-10 00:02:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:29,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:29,624 INFO L87 Difference]: Start difference. First operand 420 states and 610 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-10 00:02:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:29,658 INFO L93 Difference]: Finished difference Result 965 states and 1462 transitions. [2024-11-10 00:02:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2024-11-10 00:02:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:29,662 INFO L225 Difference]: With dead ends: 965 [2024-11-10 00:02:29,662 INFO L226 Difference]: Without dead ends: 640 [2024-11-10 00:02:29,663 INFO L431 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-10 00:02:29,666 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 200 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:29,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 701 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-10 00:02:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2024-11-10 00:02:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.488226059654631) internal successors, (948), 637 states have internal predecessors, (948), 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-10 00:02:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 948 transitions. [2024-11-10 00:02:29,696 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 948 transitions. Word has length 171 [2024-11-10 00:02:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 948 transitions. [2024-11-10 00:02:29,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-10 00:02:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 948 transitions. [2024-11-10 00:02:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 00:02:29,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:29,702 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:02:29,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash -329897327, now seen corresponding path program 1 times [2024-11-10 00:02:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619911989] [2024-11-10 00:02:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:29,826 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-10 00:02:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619911989] [2024-11-10 00:02:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619911989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305274822] [2024-11-10 00:02:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:29,828 INFO L87 Difference]: Start difference. First operand 638 states and 948 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-10 00:02:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:29,854 INFO L93 Difference]: Finished difference Result 1561 states and 2386 transitions. [2024-11-10 00:02:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 173 [2024-11-10 00:02:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:29,858 INFO L225 Difference]: With dead ends: 1561 [2024-11-10 00:02:29,858 INFO L226 Difference]: Without dead ends: 1024 [2024-11-10 00:02:29,860 INFO L431 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-10 00:02:29,861 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 187 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:29,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 681 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-11-10 00:02:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1022. [2024-11-10 00:02:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 1.5083251714005876) internal successors, (1540), 1021 states have internal predecessors, (1540), 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-10 00:02:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1540 transitions. [2024-11-10 00:02:29,880 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1540 transitions. Word has length 173 [2024-11-10 00:02:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:29,881 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1540 transitions. [2024-11-10 00:02:29,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-10 00:02:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1540 transitions. [2024-11-10 00:02:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 00:02:29,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:29,884 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:29,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:02:29,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:29,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1180926831, now seen corresponding path program 1 times [2024-11-10 00:02:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:29,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42115544] [2024-11-10 00:02:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:29,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:29,989 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-10 00:02:29,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:29,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42115544] [2024-11-10 00:02:29,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42115544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:29,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:29,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237193975] [2024-11-10 00:02:29,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:29,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:29,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:29,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:29,992 INFO L87 Difference]: Start difference. First operand 1022 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-10 00:02:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:30,021 INFO L93 Difference]: Finished difference Result 2599 states and 3982 transitions. [2024-11-10 00:02:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 175 [2024-11-10 00:02:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:30,028 INFO L225 Difference]: With dead ends: 2599 [2024-11-10 00:02:30,028 INFO L226 Difference]: Without dead ends: 1684 [2024-11-10 00:02:30,029 INFO L431 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-10 00:02:30,032 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 174 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:30,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 661 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-11-10 00:02:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2024-11-10 00:02:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.5157644259369423) internal successors, (2548), 1681 states have internal predecessors, (2548), 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-10 00:02:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2548 transitions. [2024-11-10 00:02:30,059 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2548 transitions. Word has length 175 [2024-11-10 00:02:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2548 transitions. [2024-11-10 00:02:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-10 00:02:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2548 transitions. [2024-11-10 00:02:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 00:02:30,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:30,063 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:30,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:02:30,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash 918760565, now seen corresponding path program 1 times [2024-11-10 00:02:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925249021] [2024-11-10 00:02:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:30,166 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-10 00:02:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925249021] [2024-11-10 00:02:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925249021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:30,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:30,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:30,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483596480] [2024-11-10 00:02:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:30,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:30,169 INFO L87 Difference]: Start difference. First operand 1682 states and 2548 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 00:02:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:30,209 INFO L93 Difference]: Finished difference Result 4353 states and 6646 transitions. [2024-11-10 00:02:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:30,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 177 [2024-11-10 00:02:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:30,218 INFO L225 Difference]: With dead ends: 4353 [2024-11-10 00:02:30,219 INFO L226 Difference]: Without dead ends: 2784 [2024-11-10 00:02:30,221 INFO L431 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-10 00:02:30,223 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 161 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:30,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 641 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-10 00:02:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2782. [2024-11-10 00:02:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 1.5116864437252786) internal successors, (4204), 2781 states have internal predecessors, (4204), 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-10 00:02:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 4204 transitions. [2024-11-10 00:02:30,271 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 4204 transitions. Word has length 177 [2024-11-10 00:02:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:30,272 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 4204 transitions. [2024-11-10 00:02:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 00:02:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 4204 transitions. [2024-11-10 00:02:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 00:02:30,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:30,280 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:30,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:02:30,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1576721329, now seen corresponding path program 1 times [2024-11-10 00:02:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641382809] [2024-11-10 00:02:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:30,400 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-10 00:02:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641382809] [2024-11-10 00:02:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641382809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:30,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:30,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:30,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038018529] [2024-11-10 00:02:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:30,402 INFO L87 Difference]: Start difference. First operand 2782 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-10 00:02:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:30,442 INFO L93 Difference]: Finished difference Result 7203 states and 10894 transitions. [2024-11-10 00:02:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 179 [2024-11-10 00:02:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:30,454 INFO L225 Difference]: With dead ends: 7203 [2024-11-10 00:02:30,454 INFO L226 Difference]: Without dead ends: 4540 [2024-11-10 00:02:30,457 INFO L431 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-10 00:02:30,458 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 148 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:30,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 621 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2024-11-10 00:02:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4538. [2024-11-10 00:02:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4538 states, 4537 states have (on average 1.4961428256557197) internal successors, (6788), 4537 states have internal predecessors, (6788), 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-10 00:02:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4538 states to 4538 states and 6788 transitions. [2024-11-10 00:02:30,533 INFO L78 Accepts]: Start accepts. Automaton has 4538 states and 6788 transitions. Word has length 179 [2024-11-10 00:02:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:30,534 INFO L471 AbstractCegarLoop]: Abstraction has 4538 states and 6788 transitions. [2024-11-10 00:02:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-10 00:02:30,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4538 states and 6788 transitions. [2024-11-10 00:02:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 00:02:30,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:30,541 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:02:30,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:30,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1522220519, now seen corresponding path program 1 times [2024-11-10 00:02:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942843813] [2024-11-10 00:02:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:30,762 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-10 00:02:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942843813] [2024-11-10 00:02:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942843813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069649532] [2024-11-10 00:02:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:30,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:30,765 INFO L87 Difference]: Start difference. First operand 4538 states and 6788 transitions. Second operand has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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-10 00:02:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:31,361 INFO L93 Difference]: Finished difference Result 47349 states and 70771 transitions. [2024-11-10 00:02:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:02:31,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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 181 [2024-11-10 00:02:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:31,480 INFO L225 Difference]: With dead ends: 47349 [2024-11-10 00:02:31,481 INFO L226 Difference]: Without dead ends: 42937 [2024-11-10 00:02:31,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:02:31,504 INFO L432 NwaCegarLoop]: 684 mSDtfsCounter, 3108 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:31,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3108 Valid, 4063 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42937 states. [2024-11-10 00:02:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42937 to 8879. [2024-11-10 00:02:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8879 states, 8878 states have (on average 1.471502590673575) internal successors, (13064), 8878 states have internal predecessors, (13064), 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-10 00:02:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 13064 transitions. [2024-11-10 00:02:31,974 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 13064 transitions. Word has length 181 [2024-11-10 00:02:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:31,974 INFO L471 AbstractCegarLoop]: Abstraction has 8879 states and 13064 transitions. [2024-11-10 00:02:31,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.625) internal successors, (181), 8 states have internal predecessors, (181), 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-10 00:02:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 13064 transitions. [2024-11-10 00:02:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 00:02:31,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:31,990 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:02:31,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:31,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 22258768, now seen corresponding path program 1 times [2024-11-10 00:02:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326727865] [2024-11-10 00:02:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:32,534 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-10 00:02:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326727865] [2024-11-10 00:02:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326727865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306248037] [2024-11-10 00:02:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:32,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:32,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:32,536 INFO L87 Difference]: Start difference. First operand 8879 states and 13064 transitions. Second operand has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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-10 00:02:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:32,934 INFO L93 Difference]: Finished difference Result 17633 states and 25987 transitions. [2024-11-10 00:02:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:32,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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 186 [2024-11-10 00:02:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:32,948 INFO L225 Difference]: With dead ends: 17633 [2024-11-10 00:02:32,949 INFO L226 Difference]: Without dead ends: 8881 [2024-11-10 00:02:32,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:02:32,962 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 984 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:32,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1463 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2024-11-10 00:02:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 8879. [2024-11-10 00:02:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8879 states, 8878 states have (on average 1.4569722910565444) internal successors, (12935), 8878 states have internal predecessors, (12935), 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-10 00:02:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 12935 transitions. [2024-11-10 00:02:33,087 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 12935 transitions. Word has length 186 [2024-11-10 00:02:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:33,088 INFO L471 AbstractCegarLoop]: Abstraction has 8879 states and 12935 transitions. [2024-11-10 00:02:33,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.25) internal successors, (186), 8 states have internal predecessors, (186), 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-10 00:02:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 12935 transitions. [2024-11-10 00:02:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 00:02:33,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:33,103 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:33,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:02:33,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:33,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1295426061, now seen corresponding path program 1 times [2024-11-10 00:02:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:33,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408645088] [2024-11-10 00:02:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:33,249 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-10 00:02:33,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408645088] [2024-11-10 00:02:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408645088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:33,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089974022] [2024-11-10 00:02:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:33,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:33,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:33,252 INFO L87 Difference]: Start difference. First operand 8879 states and 12935 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-10 00:02:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:33,359 INFO L93 Difference]: Finished difference Result 20392 states and 29804 transitions. [2024-11-10 00:02:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 188 [2024-11-10 00:02:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:33,379 INFO L225 Difference]: With dead ends: 20392 [2024-11-10 00:02:33,380 INFO L226 Difference]: Without dead ends: 11636 [2024-11-10 00:02:33,392 INFO L431 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-10 00:02:33,393 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 229 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:33,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 764 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11636 states. [2024-11-10 00:02:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11636 to 11634. [2024-11-10 00:02:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11633 states have (on average 1.4451130404882662) internal successors, (16811), 11633 states have internal predecessors, (16811), 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-10 00:02:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 16811 transitions. [2024-11-10 00:02:33,621 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 16811 transitions. Word has length 188 [2024-11-10 00:02:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:33,622 INFO L471 AbstractCegarLoop]: Abstraction has 11634 states and 16811 transitions. [2024-11-10 00:02:33,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-10 00:02:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 16811 transitions. [2024-11-10 00:02:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:33,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:33,645 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:02:33,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash 999866057, now seen corresponding path program 1 times [2024-11-10 00:02:33,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:33,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314680831] [2024-11-10 00:02:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:33,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:33,917 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-10 00:02:33,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:33,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314680831] [2024-11-10 00:02:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314680831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:33,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269335240] [2024-11-10 00:02:33,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:33,919 INFO L87 Difference]: Start difference. First operand 11634 states and 16811 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:34,304 INFO L93 Difference]: Finished difference Result 70976 states and 102820 transitions. [2024-11-10 00:02:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:34,393 INFO L225 Difference]: With dead ends: 70976 [2024-11-10 00:02:34,393 INFO L226 Difference]: Without dead ends: 61854 [2024-11-10 00:02:34,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:34,422 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 2407 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 2812 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:34,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 2812 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61854 states. [2024-11-10 00:02:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61854 to 21406. [2024-11-10 00:02:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21406 states, 21405 states have (on average 1.4369072646577903) internal successors, (30757), 21405 states have internal predecessors, (30757), 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-10 00:02:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21406 states to 21406 states and 30757 transitions. [2024-11-10 00:02:34,924 INFO L78 Accepts]: Start accepts. Automaton has 21406 states and 30757 transitions. Word has length 189 [2024-11-10 00:02:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:34,924 INFO L471 AbstractCegarLoop]: Abstraction has 21406 states and 30757 transitions. [2024-11-10 00:02:34,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 21406 states and 30757 transitions. [2024-11-10 00:02:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:34,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:34,947 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:02:34,947 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1461049875, now seen corresponding path program 1 times [2024-11-10 00:02:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435828372] [2024-11-10 00:02:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:35,201 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-10 00:02:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435828372] [2024-11-10 00:02:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435828372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:35,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:35,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139828905] [2024-11-10 00:02:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:35,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:35,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:35,204 INFO L87 Difference]: Start difference. First operand 21406 states and 30757 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:35,598 INFO L93 Difference]: Finished difference Result 80296 states and 116236 transitions. [2024-11-10 00:02:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:35,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:35,688 INFO L225 Difference]: With dead ends: 80296 [2024-11-10 00:02:35,688 INFO L226 Difference]: Without dead ends: 71174 [2024-11-10 00:02:35,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:35,723 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 2156 mSDsluCounter, 2514 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:35,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 3202 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71174 states. [2024-11-10 00:02:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71174 to 35895. [2024-11-10 00:02:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35895 states, 35894 states have (on average 1.4337215133448487) internal successors, (51462), 35894 states have internal predecessors, (51462), 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-10 00:02:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35895 states to 35895 states and 51462 transitions. [2024-11-10 00:02:36,640 INFO L78 Accepts]: Start accepts. Automaton has 35895 states and 51462 transitions. Word has length 189 [2024-11-10 00:02:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:36,640 INFO L471 AbstractCegarLoop]: Abstraction has 35895 states and 51462 transitions. [2024-11-10 00:02:36,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35895 states and 51462 transitions. [2024-11-10 00:02:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:36,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:36,671 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:36,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:02:36,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:36,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 403505907, now seen corresponding path program 1 times [2024-11-10 00:02:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:36,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582045585] [2024-11-10 00:02:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:36,887 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-10 00:02:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582045585] [2024-11-10 00:02:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582045585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:36,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405417716] [2024-11-10 00:02:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:36,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:36,889 INFO L87 Difference]: Start difference. First operand 35895 states and 51462 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:37,315 INFO L93 Difference]: Finished difference Result 89820 states and 129936 transitions. [2024-11-10 00:02:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:37,649 INFO L225 Difference]: With dead ends: 89820 [2024-11-10 00:02:37,650 INFO L226 Difference]: Without dead ends: 80698 [2024-11-10 00:02:37,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:37,674 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 2137 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:37,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 3063 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80698 states. [2024-11-10 00:02:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80698 to 45663. [2024-11-10 00:02:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45663 states, 45662 states have (on average 1.434891156760545) internal successors, (65520), 45662 states have internal predecessors, (65520), 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-10 00:02:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45663 states to 45663 states and 65520 transitions. [2024-11-10 00:02:38,552 INFO L78 Accepts]: Start accepts. Automaton has 45663 states and 65520 transitions. Word has length 189 [2024-11-10 00:02:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:38,552 INFO L471 AbstractCegarLoop]: Abstraction has 45663 states and 65520 transitions. [2024-11-10 00:02:38,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45663 states and 65520 transitions. [2024-11-10 00:02:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:38,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:38,592 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:02:38,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1787531108, now seen corresponding path program 1 times [2024-11-10 00:02:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520864259] [2024-11-10 00:02:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:38,921 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-10 00:02:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520864259] [2024-11-10 00:02:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520864259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:38,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255293626] [2024-11-10 00:02:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:38,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:38,923 INFO L87 Difference]: Start difference. First operand 45663 states and 65520 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:39,522 INFO L93 Difference]: Finished difference Result 99482 states and 143838 transitions. [2024-11-10 00:02:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:39,636 INFO L225 Difference]: With dead ends: 99482 [2024-11-10 00:02:39,636 INFO L226 Difference]: Without dead ends: 90360 [2024-11-10 00:02:39,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:39,663 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1988 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:39,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 3652 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90360 states. [2024-11-10 00:02:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90360 to 55458. [2024-11-10 00:02:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55458 states, 55457 states have (on average 1.435761040085111) internal successors, (79623), 55457 states have internal predecessors, (79623), 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-10 00:02:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55458 states to 55458 states and 79623 transitions. [2024-11-10 00:02:40,605 INFO L78 Accepts]: Start accepts. Automaton has 55458 states and 79623 transitions. Word has length 189 [2024-11-10 00:02:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:40,605 INFO L471 AbstractCegarLoop]: Abstraction has 55458 states and 79623 transitions. [2024-11-10 00:02:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 55458 states and 79623 transitions. [2024-11-10 00:02:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:40,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:40,817 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:40,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:02:40,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash -656064419, now seen corresponding path program 1 times [2024-11-10 00:02:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48239953] [2024-11-10 00:02:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:41,007 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-10 00:02:41,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48239953] [2024-11-10 00:02:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48239953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:41,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575084228] [2024-11-10 00:02:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:41,009 INFO L87 Difference]: Start difference. First operand 55458 states and 79623 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:41,520 INFO L93 Difference]: Finished difference Result 109231 states and 157871 transitions. [2024-11-10 00:02:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:41,632 INFO L225 Difference]: With dead ends: 109231 [2024-11-10 00:02:41,632 INFO L226 Difference]: Without dead ends: 100109 [2024-11-10 00:02:41,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:41,660 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 2086 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:41,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 3823 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100109 states. [2024-11-10 00:02:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100109 to 65262. [2024-11-10 00:02:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65262 states, 65261 states have (on average 1.4364015261794947) internal successors, (93741), 65261 states have internal predecessors, (93741), 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-10 00:02:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65262 states to 65262 states and 93741 transitions. [2024-11-10 00:02:42,740 INFO L78 Accepts]: Start accepts. Automaton has 65262 states and 93741 transitions. Word has length 189 [2024-11-10 00:02:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:42,741 INFO L471 AbstractCegarLoop]: Abstraction has 65262 states and 93741 transitions. [2024-11-10 00:02:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 65262 states and 93741 transitions. [2024-11-10 00:02:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 00:02:42,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:42,791 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:42,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:02:42,791 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:42,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1460012218, now seen corresponding path program 1 times [2024-11-10 00:02:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:42,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254079524] [2024-11-10 00:02:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:43,230 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-10 00:02:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254079524] [2024-11-10 00:02:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254079524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:02:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571427303] [2024-11-10 00:02:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:43,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:02:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:02:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:02:43,233 INFO L87 Difference]: Start difference. First operand 65262 states and 93741 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:43,660 INFO L93 Difference]: Finished difference Result 113286 states and 163740 transitions. [2024-11-10 00:02:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:02:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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 189 [2024-11-10 00:02:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:43,790 INFO L225 Difference]: With dead ends: 113286 [2024-11-10 00:02:43,790 INFO L226 Difference]: Without dead ends: 107076 [2024-11-10 00:02:43,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:02:43,829 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 2208 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2964 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:43,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2964 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:02:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107076 states. [2024-11-10 00:02:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107076 to 72229. [2024-11-10 00:02:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72229 states, 72228 states have (on average 1.4375865315390153) internal successors, (103834), 72228 states have internal predecessors, (103834), 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-10 00:02:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72229 states to 72229 states and 103834 transitions. [2024-11-10 00:02:45,039 INFO L78 Accepts]: Start accepts. Automaton has 72229 states and 103834 transitions. Word has length 189 [2024-11-10 00:02:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:45,040 INFO L471 AbstractCegarLoop]: Abstraction has 72229 states and 103834 transitions. [2024-11-10 00:02:45,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 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-10 00:02:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72229 states and 103834 transitions. [2024-11-10 00:02:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:45,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:45,088 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:45,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:02:45,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -532905582, now seen corresponding path program 1 times [2024-11-10 00:02:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232266799] [2024-11-10 00:02:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:45,159 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-10 00:02:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:45,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232266799] [2024-11-10 00:02:45,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232266799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:45,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:45,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:45,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500747914] [2024-11-10 00:02:45,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:45,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:45,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:45,162 INFO L87 Difference]: Start difference. First operand 72229 states and 103834 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:46,059 INFO L93 Difference]: Finished difference Result 211415 states and 303885 transitions. [2024-11-10 00:02:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:46,232 INFO L225 Difference]: With dead ends: 211415 [2024-11-10 00:02:46,232 INFO L226 Difference]: Without dead ends: 143600 [2024-11-10 00:02:46,305 INFO L431 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-10 00:02:46,305 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 173 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:46,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 500 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:02:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143600 states. [2024-11-10 00:02:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143600 to 143598. [2024-11-10 00:02:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143598 states, 143597 states have (on average 1.4297304261231085) internal successors, (205305), 143597 states have internal predecessors, (205305), 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-10 00:02:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143598 states to 143598 states and 205305 transitions. [2024-11-10 00:02:48,515 INFO L78 Accepts]: Start accepts. Automaton has 143598 states and 205305 transitions. Word has length 191 [2024-11-10 00:02:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 143598 states and 205305 transitions. [2024-11-10 00:02:48,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 143598 states and 205305 transitions. [2024-11-10 00:02:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:49,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:49,033 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:49,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:02:49,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:49,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash -497668013, now seen corresponding path program 1 times [2024-11-10 00:02:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861708271] [2024-11-10 00:02:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:49,304 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-10 00:02:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861708271] [2024-11-10 00:02:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861708271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119393937] [2024-11-10 00:02:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:49,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:49,307 INFO L87 Difference]: Start difference. First operand 143598 states and 205305 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:49,879 INFO L93 Difference]: Finished difference Result 235282 states and 338267 transitions. [2024-11-10 00:02:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:49,989 INFO L225 Difference]: With dead ends: 235282 [2024-11-10 00:02:49,989 INFO L226 Difference]: Without dead ends: 100474 [2024-11-10 00:02:50,069 INFO L431 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-10 00:02:50,070 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 129 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:50,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 648 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100474 states. [2024-11-10 00:02:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100474 to 100472. [2024-11-10 00:02:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100472 states, 100471 states have (on average 1.4332991609519166) internal successors, (144005), 100471 states have internal predecessors, (144005), 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-10 00:02:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100472 states to 100472 states and 144005 transitions. [2024-11-10 00:02:52,176 INFO L78 Accepts]: Start accepts. Automaton has 100472 states and 144005 transitions. Word has length 191 [2024-11-10 00:02:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:52,176 INFO L471 AbstractCegarLoop]: Abstraction has 100472 states and 144005 transitions. [2024-11-10 00:02:52,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 100472 states and 144005 transitions. [2024-11-10 00:02:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:52,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:52,214 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:52,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:02:52,214 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:52,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -214781301, now seen corresponding path program 1 times [2024-11-10 00:02:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414325401] [2024-11-10 00:02:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:52,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:52,303 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-10 00:02:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414325401] [2024-11-10 00:02:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414325401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404395490] [2024-11-10 00:02:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:52,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:52,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:52,305 INFO L87 Difference]: Start difference. First operand 100472 states and 144005 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:52,587 INFO L93 Difference]: Finished difference Result 146316 states and 210007 transitions. [2024-11-10 00:02:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:52,641 INFO L225 Difference]: With dead ends: 146316 [2024-11-10 00:02:52,642 INFO L226 Difference]: Without dead ends: 50815 [2024-11-10 00:02:52,695 INFO L431 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-10 00:02:52,695 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 122 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:52,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 626 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50815 states. [2024-11-10 00:02:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50815 to 50813. [2024-11-10 00:02:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50813 states, 50812 states have (on average 1.4229709517436826) internal successors, (72304), 50812 states have internal predecessors, (72304), 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-10 00:02:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50813 states to 50813 states and 72304 transitions. [2024-11-10 00:02:53,510 INFO L78 Accepts]: Start accepts. Automaton has 50813 states and 72304 transitions. Word has length 191 [2024-11-10 00:02:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:53,510 INFO L471 AbstractCegarLoop]: Abstraction has 50813 states and 72304 transitions. [2024-11-10 00:02:53,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 50813 states and 72304 transitions. [2024-11-10 00:02:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:53,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:53,528 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:02:53,529 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1710511149, now seen corresponding path program 1 times [2024-11-10 00:02:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062626530] [2024-11-10 00:02:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:53,617 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-10 00:02:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062626530] [2024-11-10 00:02:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062626530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292455446] [2024-11-10 00:02:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:53,619 INFO L87 Difference]: Start difference. First operand 50813 states and 72304 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:53,754 INFO L93 Difference]: Finished difference Result 73737 states and 105066 transitions. [2024-11-10 00:02:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:53,779 INFO L225 Difference]: With dead ends: 73737 [2024-11-10 00:02:53,779 INFO L226 Difference]: Without dead ends: 25726 [2024-11-10 00:02:53,805 INFO L431 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-10 00:02:53,806 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 115 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:53,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 604 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25726 states. [2024-11-10 00:02:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25726 to 25724. [2024-11-10 00:02:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25724 states, 25723 states have (on average 1.4121603234459432) internal successors, (36325), 25723 states have internal predecessors, (36325), 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-10 00:02:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25724 states to 25724 states and 36325 transitions. [2024-11-10 00:02:54,285 INFO L78 Accepts]: Start accepts. Automaton has 25724 states and 36325 transitions. Word has length 191 [2024-11-10 00:02:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:54,285 INFO L471 AbstractCegarLoop]: Abstraction has 25724 states and 36325 transitions. [2024-11-10 00:02:54,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 25724 states and 36325 transitions. [2024-11-10 00:02:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:54,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:54,295 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:02:54,295 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1450874048, now seen corresponding path program 1 times [2024-11-10 00:02:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849046973] [2024-11-10 00:02:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:54,397 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-10 00:02:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849046973] [2024-11-10 00:02:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849046973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734181808] [2024-11-10 00:02:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:54,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:54,399 INFO L87 Difference]: Start difference. First operand 25724 states and 36325 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:54,470 INFO L93 Difference]: Finished difference Result 37188 states and 52587 transitions. [2024-11-10 00:02:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:54,481 INFO L225 Difference]: With dead ends: 37188 [2024-11-10 00:02:54,481 INFO L226 Difference]: Without dead ends: 13097 [2024-11-10 00:02:54,493 INFO L431 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-10 00:02:54,494 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 110 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:54,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 582 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13097 states. [2024-11-10 00:02:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13097 to 13095. [2024-11-10 00:02:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13095 states, 13094 states have (on average 1.4006415151978004) internal successors, (18340), 13094 states have internal predecessors, (18340), 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-10 00:02:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13095 states to 13095 states and 18340 transitions. [2024-11-10 00:02:54,595 INFO L78 Accepts]: Start accepts. Automaton has 13095 states and 18340 transitions. Word has length 191 [2024-11-10 00:02:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 13095 states and 18340 transitions. [2024-11-10 00:02:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13095 states and 18340 transitions. [2024-11-10 00:02:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:54,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:54,600 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:54,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:02:54,600 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -692408945, now seen corresponding path program 1 times [2024-11-10 00:02:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459752229] [2024-11-10 00:02:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:54,694 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-10 00:02:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459752229] [2024-11-10 00:02:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459752229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123152733] [2024-11-10 00:02:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:54,696 INFO L87 Difference]: Start difference. First operand 13095 states and 18340 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:54,738 INFO L93 Difference]: Finished difference Result 18829 states and 26412 transitions. [2024-11-10 00:02:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:54,746 INFO L225 Difference]: With dead ends: 18829 [2024-11-10 00:02:54,746 INFO L226 Difference]: Without dead ends: 6763 [2024-11-10 00:02:54,752 INFO L431 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-10 00:02:54,753 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 105 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:54,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 560 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-10 00:02:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2024-11-10 00:02:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3887573964497042) internal successors, (9388), 6760 states have internal predecessors, (9388), 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-10 00:02:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9388 transitions. [2024-11-10 00:02:54,809 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9388 transitions. Word has length 191 [2024-11-10 00:02:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9388 transitions. [2024-11-10 00:02:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9388 transitions. [2024-11-10 00:02:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:54,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:54,812 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:54,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:02:54,813 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:54,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash -834810602, now seen corresponding path program 1 times [2024-11-10 00:02:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077385289] [2024-11-10 00:02:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:54,905 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-10 00:02:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077385289] [2024-11-10 00:02:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077385289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:54,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:54,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:02:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599376862] [2024-11-10 00:02:54,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:54,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:02:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:54,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:02:54,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:02:54,907 INFO L87 Difference]: Start difference. First operand 6761 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:54,932 INFO L93 Difference]: Finished difference Result 9630 states and 13395 transitions. [2024-11-10 00:02:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:02:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:54,936 INFO L225 Difference]: With dead ends: 9630 [2024-11-10 00:02:54,936 INFO L226 Difference]: Without dead ends: 3604 [2024-11-10 00:02:54,939 INFO L431 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-10 00:02:54,939 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 100 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:54,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 538 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:02:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2024-11-10 00:02:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3602. [2024-11-10 00:02:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3602 states, 3601 states have (on average 1.3748958622604832) internal successors, (4951), 3601 states have internal predecessors, (4951), 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-10 00:02:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 4951 transitions. [2024-11-10 00:02:55,121 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 4951 transitions. Word has length 191 [2024-11-10 00:02:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:55,121 INFO L471 AbstractCegarLoop]: Abstraction has 3602 states and 4951 transitions. [2024-11-10 00:02:55,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 00:02:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 4951 transitions. [2024-11-10 00:02:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:55,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:55,124 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:55,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:02:55,124 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash -801874293, now seen corresponding path program 1 times [2024-11-10 00:02:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924273410] [2024-11-10 00:02:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:55,485 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-10 00:02:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924273410] [2024-11-10 00:02:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924273410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:55,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:02:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004407192] [2024-11-10 00:02:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:55,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:02:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:02:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:02:55,487 INFO L87 Difference]: Start difference. First operand 3602 states and 4951 transitions. Second operand has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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-10 00:02:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:55,969 INFO L93 Difference]: Finished difference Result 10711 states and 14742 transitions. [2024-11-10 00:02:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:02:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:55,976 INFO L225 Difference]: With dead ends: 10711 [2024-11-10 00:02:55,976 INFO L226 Difference]: Without dead ends: 7214 [2024-11-10 00:02:55,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:55,979 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1003 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:55,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 957 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2024-11-10 00:02:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 7122. [2024-11-10 00:02:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7122 states, 7121 states have (on average 1.370594017694144) internal successors, (9760), 7121 states have internal predecessors, (9760), 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-10 00:02:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7122 states to 7122 states and 9760 transitions. [2024-11-10 00:02:56,070 INFO L78 Accepts]: Start accepts. Automaton has 7122 states and 9760 transitions. Word has length 191 [2024-11-10 00:02:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 7122 states and 9760 transitions. [2024-11-10 00:02:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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-10 00:02:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7122 states and 9760 transitions. [2024-11-10 00:02:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:56,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:56,075 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:02:56,076 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:56,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1957797420, now seen corresponding path program 1 times [2024-11-10 00:02:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345726596] [2024-11-10 00:02:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:56,666 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-10 00:02:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345726596] [2024-11-10 00:02:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345726596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:02:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896359574] [2024-11-10 00:02:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 00:02:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 00:02:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:02:56,669 INFO L87 Difference]: Start difference. First operand 7122 states and 9760 transitions. Second operand has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 13 states have internal predecessors, (191), 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-10 00:02:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:57,320 INFO L93 Difference]: Finished difference Result 21405 states and 29223 transitions. [2024-11-10 00:02:57,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:02:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 13 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:57,337 INFO L225 Difference]: With dead ends: 21405 [2024-11-10 00:02:57,338 INFO L226 Difference]: Without dead ends: 14376 [2024-11-10 00:02:57,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:02:57,346 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 2302 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:57,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 1361 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:02:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14376 states. [2024-11-10 00:02:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14376 to 13952. [2024-11-10 00:02:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13952 states, 13951 states have (on average 1.366783743100853) internal successors, (19068), 13951 states have internal predecessors, (19068), 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-10 00:02:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13952 states to 13952 states and 19068 transitions. [2024-11-10 00:02:57,533 INFO L78 Accepts]: Start accepts. Automaton has 13952 states and 19068 transitions. Word has length 191 [2024-11-10 00:02:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:57,533 INFO L471 AbstractCegarLoop]: Abstraction has 13952 states and 19068 transitions. [2024-11-10 00:02:57,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.642857142857142) internal successors, (191), 13 states have internal predecessors, (191), 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-10 00:02:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13952 states and 19068 transitions. [2024-11-10 00:02:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 00:02:57,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:57,539 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:02:57,539 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:57,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1031779979, now seen corresponding path program 1 times [2024-11-10 00:02:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:57,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025480539] [2024-11-10 00:02:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:57,891 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-10 00:02:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025480539] [2024-11-10 00:02:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025480539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:02:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778137113] [2024-11-10 00:02:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:02:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:02:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:02:57,893 INFO L87 Difference]: Start difference. First operand 13952 states and 19068 transitions. Second operand has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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-10 00:02:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:58,405 INFO L93 Difference]: Finished difference Result 40508 states and 55258 transitions. [2024-11-10 00:02:58,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 00:02:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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 191 [2024-11-10 00:02:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:58,431 INFO L225 Difference]: With dead ends: 40508 [2024-11-10 00:02:58,431 INFO L226 Difference]: Without dead ends: 26742 [2024-11-10 00:02:58,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-10 00:02:58,445 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1476 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:58,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1128 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26742 states. [2024-11-10 00:02:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26742 to 26380. [2024-11-10 00:02:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26380 states, 26379 states have (on average 1.3613859509458281) internal successors, (35912), 26379 states have internal predecessors, (35912), 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-10 00:02:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26380 states to 26380 states and 35912 transitions. [2024-11-10 00:02:58,692 INFO L78 Accepts]: Start accepts. Automaton has 26380 states and 35912 transitions. Word has length 191 [2024-11-10 00:02:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:58,692 INFO L471 AbstractCegarLoop]: Abstraction has 26380 states and 35912 transitions. [2024-11-10 00:02:58,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.1) internal successors, (191), 9 states have internal predecessors, (191), 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-10 00:02:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 26380 states and 35912 transitions. [2024-11-10 00:02:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-10 00:02:58,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:58,702 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:58,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:02:58,702 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1985347061, now seen corresponding path program 1 times [2024-11-10 00:02:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881706313] [2024-11-10 00:02:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:59,041 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-10 00:02:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881706313] [2024-11-10 00:02:59,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881706313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:59,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:02:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065857325] [2024-11-10 00:02:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:59,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:02:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:02:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:02:59,043 INFO L87 Difference]: Start difference. First operand 26380 states and 35912 transitions. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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-10 00:02:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:02:59,578 INFO L93 Difference]: Finished difference Result 52020 states and 70800 transitions. [2024-11-10 00:02:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:02:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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 192 [2024-11-10 00:02:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:02:59,607 INFO L225 Difference]: With dead ends: 52020 [2024-11-10 00:02:59,608 INFO L226 Difference]: Without dead ends: 26854 [2024-11-10 00:02:59,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:02:59,628 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1197 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:02:59,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 951 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:02:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26854 states. [2024-11-10 00:02:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26854 to 26460. [2024-11-10 00:02:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26460 states, 26459 states have (on average 1.3608979931214331) internal successors, (36008), 26459 states have internal predecessors, (36008), 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-10 00:02:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26460 states to 26460 states and 36008 transitions. [2024-11-10 00:02:59,902 INFO L78 Accepts]: Start accepts. Automaton has 26460 states and 36008 transitions. Word has length 192 [2024-11-10 00:02:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:02:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 26460 states and 36008 transitions. [2024-11-10 00:02:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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-10 00:02:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26460 states and 36008 transitions. [2024-11-10 00:02:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-10 00:02:59,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:02:59,913 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:02:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:02:59,913 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:02:59,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:02:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1356295557, now seen corresponding path program 1 times [2024-11-10 00:02:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:02:59,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497475699] [2024-11-10 00:02:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:02:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:02:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:02:59,991 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-10 00:02:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:02:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497475699] [2024-11-10 00:02:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497475699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:02:59,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:02:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:02:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547399423] [2024-11-10 00:02:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:02:59,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:02:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:02:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:02:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:02:59,992 INFO L87 Difference]: Start difference. First operand 26460 states and 36008 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-10 00:03:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:00,246 INFO L93 Difference]: Finished difference Result 52524 states and 71486 transitions. [2024-11-10 00:03:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:03:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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 192 [2024-11-10 00:03:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:00,274 INFO L225 Difference]: With dead ends: 52524 [2024-11-10 00:03:00,274 INFO L226 Difference]: Without dead ends: 29602 [2024-11-10 00:03:00,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:03:00,292 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 173 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:00,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 669 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:03:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29602 states. [2024-11-10 00:03:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29602 to 26460. [2024-11-10 00:03:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26460 states, 26459 states have (on average 1.3608979931214331) internal successors, (36008), 26459 states have internal predecessors, (36008), 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-10 00:03:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26460 states to 26460 states and 36008 transitions. [2024-11-10 00:03:00,614 INFO L78 Accepts]: Start accepts. Automaton has 26460 states and 36008 transitions. Word has length 192 [2024-11-10 00:03:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:00,614 INFO L471 AbstractCegarLoop]: Abstraction has 26460 states and 36008 transitions. [2024-11-10 00:03:00,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-10 00:03:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 26460 states and 36008 transitions. [2024-11-10 00:03:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-10 00:03:00,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:00,623 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:00,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 00:03:00,623 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1391533126, now seen corresponding path program 1 times [2024-11-10 00:03:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430510921] [2024-11-10 00:03:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:00,868 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-10 00:03:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430510921] [2024-11-10 00:03:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430510921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34463413] [2024-11-10 00:03:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:03:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:03:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:03:00,871 INFO L87 Difference]: Start difference. First operand 26460 states and 36008 transitions. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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-10 00:03:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:01,411 INFO L93 Difference]: Finished difference Result 79329 states and 107763 transitions. [2024-11-10 00:03:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:03:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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 192 [2024-11-10 00:03:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:01,471 INFO L225 Difference]: With dead ends: 79329 [2024-11-10 00:03:01,471 INFO L226 Difference]: Without dead ends: 52956 [2024-11-10 00:03:01,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:03:01,500 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 1385 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:01,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1103 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:03:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52956 states. [2024-11-10 00:03:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52956 to 52234. [2024-11-10 00:03:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52234 states, 52233 states have (on average 1.3565753450883542) internal successors, (70858), 52233 states have internal predecessors, (70858), 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-10 00:03:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52234 states to 52234 states and 70858 transitions. [2024-11-10 00:03:02,140 INFO L78 Accepts]: Start accepts. Automaton has 52234 states and 70858 transitions. Word has length 192 [2024-11-10 00:03:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:02,140 INFO L471 AbstractCegarLoop]: Abstraction has 52234 states and 70858 transitions. [2024-11-10 00:03:02,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 9 states have internal predecessors, (192), 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-10 00:03:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 52234 states and 70858 transitions. [2024-11-10 00:03:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 00:03:02,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:02,160 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:02,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 00:03:02,160 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:02,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:02,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1615971330, now seen corresponding path program 1 times [2024-11-10 00:03:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395533134] [2024-11-10 00:03:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:02,223 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-10 00:03:02,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395533134] [2024-11-10 00:03:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395533134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921159907] [2024-11-10 00:03:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:02,226 INFO L87 Difference]: Start difference. First operand 52234 states and 70858 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10 00:03:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:02,500 INFO L93 Difference]: Finished difference Result 103256 states and 140385 transitions. [2024-11-10 00:03:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 193 [2024-11-10 00:03:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:02,554 INFO L225 Difference]: With dead ends: 103256 [2024-11-10 00:03:02,554 INFO L226 Difference]: Without dead ends: 51551 [2024-11-10 00:03:02,588 INFO L431 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-10 00:03:02,588 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 155 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:02,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 379 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51551 states. [2024-11-10 00:03:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51551 to 51551. [2024-11-10 00:03:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51551 states, 51550 states have (on average 1.350591658583899) internal successors, (69623), 51550 states have internal predecessors, (69623), 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-10 00:03:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51551 states to 51551 states and 69623 transitions. [2024-11-10 00:03:03,251 INFO L78 Accepts]: Start accepts. Automaton has 51551 states and 69623 transitions. Word has length 193 [2024-11-10 00:03:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 51551 states and 69623 transitions. [2024-11-10 00:03:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10 00:03:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51551 states and 69623 transitions. [2024-11-10 00:03:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 00:03:03,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:03,269 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:03,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 00:03:03,270 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:03,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2049395299, now seen corresponding path program 1 times [2024-11-10 00:03:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:03,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315955528] [2024-11-10 00:03:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:03,548 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-10 00:03:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315955528] [2024-11-10 00:03:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315955528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064440125] [2024-11-10 00:03:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:03:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:03:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:03:03,551 INFO L87 Difference]: Start difference. First operand 51551 states and 69623 transitions. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 9 states have internal predecessors, (193), 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-10 00:03:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:04,480 INFO L93 Difference]: Finished difference Result 155151 states and 209089 transitions. [2024-11-10 00:03:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:03:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 9 states have internal predecessors, (193), 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 193 [2024-11-10 00:03:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:04,604 INFO L225 Difference]: With dead ends: 155151 [2024-11-10 00:03:04,604 INFO L226 Difference]: Without dead ends: 103703 [2024-11-10 00:03:04,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:03:04,616 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1420 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:04,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1074 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:03:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103703 states. [2024-11-10 00:03:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103703 to 102261. [2024-11-10 00:03:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102261 states, 102260 states have (on average 1.345149618619206) internal successors, (137555), 102260 states have internal predecessors, (137555), 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-10 00:03:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102261 states to 102261 states and 137555 transitions. [2024-11-10 00:03:05,893 INFO L78 Accepts]: Start accepts. Automaton has 102261 states and 137555 transitions. Word has length 193 [2024-11-10 00:03:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:05,893 INFO L471 AbstractCegarLoop]: Abstraction has 102261 states and 137555 transitions. [2024-11-10 00:03:05,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 9 states have internal predecessors, (193), 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-10 00:03:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 102261 states and 137555 transitions. [2024-11-10 00:03:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 00:03:05,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:05,936 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:05,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 00:03:05,936 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:05,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash -236711223, now seen corresponding path program 1 times [2024-11-10 00:03:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:05,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417743001] [2024-11-10 00:03:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:06,586 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-10 00:03:06,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417743001] [2024-11-10 00:03:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417743001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 00:03:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259803934] [2024-11-10 00:03:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:03:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:03:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:03:06,588 INFO L87 Difference]: Start difference. First operand 102261 states and 137555 transitions. Second operand has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 12 states have internal predecessors, (194), 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-10 00:03:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:07,916 INFO L93 Difference]: Finished difference Result 248299 states and 334102 transitions. [2024-11-10 00:03:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 00:03:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 12 states have internal predecessors, (194), 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 194 [2024-11-10 00:03:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:08,077 INFO L225 Difference]: With dead ends: 248299 [2024-11-10 00:03:08,077 INFO L226 Difference]: Without dead ends: 148596 [2024-11-10 00:03:08,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:03:08,142 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 2814 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:08,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 1375 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:03:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148596 states. [2024-11-10 00:03:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148596 to 98994. [2024-11-10 00:03:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98994 states, 98993 states have (on average 1.3458830422353096) internal successors, (133233), 98993 states have internal predecessors, (133233), 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-10 00:03:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98994 states to 98994 states and 133233 transitions. [2024-11-10 00:03:09,519 INFO L78 Accepts]: Start accepts. Automaton has 98994 states and 133233 transitions. Word has length 194 [2024-11-10 00:03:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:09,519 INFO L471 AbstractCegarLoop]: Abstraction has 98994 states and 133233 transitions. [2024-11-10 00:03:09,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 12 states have internal predecessors, (194), 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-10 00:03:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98994 states and 133233 transitions. [2024-11-10 00:03:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 00:03:09,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:09,538 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 00:03:09,538 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:09,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -48680194, now seen corresponding path program 1 times [2024-11-10 00:03:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261328469] [2024-11-10 00:03:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:09,583 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-10 00:03:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261328469] [2024-11-10 00:03:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261328469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:09,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:09,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:03:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295402746] [2024-11-10 00:03:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:03:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:03:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:03:09,585 INFO L87 Difference]: Start difference. First operand 98994 states and 133233 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-10 00:03:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:10,483 INFO L93 Difference]: Finished difference Result 193843 states and 261524 transitions. [2024-11-10 00:03:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:03:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 194 [2024-11-10 00:03:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:10,585 INFO L225 Difference]: With dead ends: 193843 [2024-11-10 00:03:10,585 INFO L226 Difference]: Without dead ends: 96742 [2024-11-10 00:03:10,618 INFO L431 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-10 00:03:10,619 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 178 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:10,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 331 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:03:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96742 states. [2024-11-10 00:03:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96742 to 96742. [2024-11-10 00:03:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96742 states, 96741 states have (on average 1.3392770386909376) internal successors, (129563), 96741 states have internal predecessors, (129563), 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-10 00:03:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96742 states to 96742 states and 129563 transitions. [2024-11-10 00:03:11,880 INFO L78 Accepts]: Start accepts. Automaton has 96742 states and 129563 transitions. Word has length 194 [2024-11-10 00:03:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 96742 states and 129563 transitions. [2024-11-10 00:03:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-10 00:03:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 96742 states and 129563 transitions. [2024-11-10 00:03:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 00:03:11,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:11,901 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:11,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 00:03:11,902 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -578496596, now seen corresponding path program 1 times [2024-11-10 00:03:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569467857] [2024-11-10 00:03:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:12,212 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-10 00:03:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:12,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569467857] [2024-11-10 00:03:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569467857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:12,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:12,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:03:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637415652] [2024-11-10 00:03:12,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:03:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:03:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:03:12,215 INFO L87 Difference]: Start difference. First operand 96742 states and 129563 transitions. Second operand has 10 states, 10 states have (on average 19.5) internal successors, (195), 9 states have internal predecessors, (195), 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-10 00:03:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:13,512 INFO L93 Difference]: Finished difference Result 238067 states and 318800 transitions. [2024-11-10 00:03:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:03:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.5) internal successors, (195), 9 states have internal predecessors, (195), 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 195 [2024-11-10 00:03:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:13,656 INFO L225 Difference]: With dead ends: 238067 [2024-11-10 00:03:13,657 INFO L226 Difference]: Without dead ends: 146336 [2024-11-10 00:03:13,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:03:13,678 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1169 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:13,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 1328 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:03:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146336 states. [2024-11-10 00:03:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146336 to 96742. [2024-11-10 00:03:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96742 states, 96741 states have (on average 1.3392770386909376) internal successors, (129563), 96741 states have internal predecessors, (129563), 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-10 00:03:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96742 states to 96742 states and 129563 transitions. [2024-11-10 00:03:14,911 INFO L78 Accepts]: Start accepts. Automaton has 96742 states and 129563 transitions. Word has length 195 [2024-11-10 00:03:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 96742 states and 129563 transitions. [2024-11-10 00:03:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.5) internal successors, (195), 9 states have internal predecessors, (195), 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-10 00:03:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 96742 states and 129563 transitions. [2024-11-10 00:03:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 00:03:14,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:14,927 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:14,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 00:03:14,927 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1175456612, now seen corresponding path program 1 times [2024-11-10 00:03:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:14,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126104982] [2024-11-10 00:03:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:15,148 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-10 00:03:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:15,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126104982] [2024-11-10 00:03:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126104982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:15,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:03:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541396404] [2024-11-10 00:03:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:15,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:03:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:15,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:03:15,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:03:15,150 INFO L87 Difference]: Start difference. First operand 96742 states and 129563 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-10 00:03:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:03:15,470 INFO L93 Difference]: Finished difference Result 188736 states and 252756 transitions. [2024-11-10 00:03:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:03:15,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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 195 [2024-11-10 00:03:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:03:15,576 INFO L225 Difference]: With dead ends: 188736 [2024-11-10 00:03:15,576 INFO L226 Difference]: Without dead ends: 96567 [2024-11-10 00:03:16,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:03:16,018 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 2 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:03:16,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 926 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:03:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96567 states. [2024-11-10 00:03:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96567 to 96567. [2024-11-10 00:03:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96567 states, 96566 states have (on average 1.3347969264544457) internal successors, (128896), 96566 states have internal predecessors, (128896), 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-10 00:03:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96567 states to 96567 states and 128896 transitions. [2024-11-10 00:03:17,383 INFO L78 Accepts]: Start accepts. Automaton has 96567 states and 128896 transitions. Word has length 195 [2024-11-10 00:03:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:03:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 96567 states and 128896 transitions. [2024-11-10 00:03:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-10 00:03:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 96567 states and 128896 transitions. [2024-11-10 00:03:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 00:03:17,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:03:17,406 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:03:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 00:03:17,406 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:03:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:03:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1400920159, now seen corresponding path program 1 times [2024-11-10 00:03:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:03:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452018727] [2024-11-10 00:03:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:03:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:03:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:03:17,619 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-10 00:03:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:03:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452018727] [2024-11-10 00:03:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452018727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:03:17,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:03:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:03:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011124256] [2024-11-10 00:03:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:03:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:03:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:03:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:03:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:03:17,621 INFO L87 Difference]: Start difference. First operand 96567 states and 128896 transitions. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 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)