./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.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.5.ufo.BOUNDED-10.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 1d2ed0f37ff2caecb0f852b41838696d35f940cfb2007be63d1246f35f6e95b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:00:51,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:00:51,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:00:51,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:00:51,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:00:51,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:00:51,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:00:51,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:00:51,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:00:51,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:00:51,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:00:51,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:00:51,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:00:51,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:00:51,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:00:51,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:00:51,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:00:51,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:00:51,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:00:51,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:00:51,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:00:51,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:00:51,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:00:51,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:00:51,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:00:51,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:00:51,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:00:51,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:00:51,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:00:51,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:00:51,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:00:51,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:00:51,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:00:51,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:00:51,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:00:51,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:00:51,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:00:51,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:00:51,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:00:51,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:00:51,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:00:51,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:00:51,520 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 -> 1d2ed0f37ff2caecb0f852b41838696d35f940cfb2007be63d1246f35f6e95b8 [2024-11-10 00:00:51,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:00:51,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:00:51,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:00:51,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:00:51,859 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:00:51,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-11-10 00:00:53,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:00:53,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:00:53,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-11-10 00:00:53,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5507f2fc0/2432744ca6a041a8b2475945f8e835ae/FLAGbb75c88b6 [2024-11-10 00:00:53,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5507f2fc0/2432744ca6a041a8b2475945f8e835ae [2024-11-10 00:00:53,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:00:53,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:00:53,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:00:53,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:00:53,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:00:53,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:00:53" (1/1) ... [2024-11-10 00:00:53,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1daee3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:53, skipping insertion in model container [2024-11-10 00:00:53,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:00:53" (1/1) ... [2024-11-10 00:00:53,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:00:54,259 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.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[14220,14233] [2024-11-10 00:00:54,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:00:54,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:00:54,479 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.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[14220,14233] [2024-11-10 00:00:54,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:00:54,573 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:00:54,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54 WrapperNode [2024-11-10 00:00:54,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:00:54,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:00:54,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:00:54,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:00:54,583 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:00:54" (1/1) ... [2024-11-10 00:00:54,601 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:00:54" (1/1) ... [2024-11-10 00:00:54,672 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1287 [2024-11-10 00:00:54,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:00:54,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:00:54,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:00:54,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:00:54,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,733 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:00:54,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:00:54,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:00:54,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:00:54,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:00:54,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (1/1) ... [2024-11-10 00:00:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:00:54,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:00:54,818 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:00:54,825 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:00:54,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:00:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:00:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:00:54,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:00:55,050 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:00:55,055 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:00:56,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-10 00:00:56,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-10 00:00:56,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-10 00:00:56,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-10 00:00:56,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1391: havoc main_~node5____CPAchecker_TMP_0~2#1; [2024-11-10 00:00:56,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;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:00:56,248 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;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:00:56,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;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:00:56,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;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:00:56,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node1__m1~1#1;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:00:56,249 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L797: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-10 00:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;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:00:56,250 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;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:00:56,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;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:00:56,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;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:00:56,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_~node1__m1~3#1;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:00:56,251 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-10 00:00:56,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: havoc main_~node5____CPAchecker_TMP_0~3#1; [2024-11-10 00:00:56,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526: havoc main_~node2____CPAchecker_TMP_0~2#1; [2024-11-10 00:00:56,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: havoc main_~node5____CPAchecker_TMP_0~4#1; [2024-11-10 00:00:56,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792: havoc main_~node2____CPAchecker_TMP_0~3#1; [2024-11-10 00:00:56,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc main_~node2____CPAchecker_TMP_0~4#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L903: havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: havoc main_~node4____CPAchecker_TMP_0~1#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1038: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:00:56,253 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: havoc main_~node5__m5~0#1;havoc main_~node4__m4~0#1; [2024-11-10 00:00:56,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L511: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:00:56,254 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L511: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:00:56,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L511: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1; [2024-11-10 00:00:56,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1436: havoc main_~node4____CPAchecker_TMP_0~2#1; [2024-11-10 00:00:56,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-10 00:00:56,255 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1702: havoc main_~node4____CPAchecker_TMP_0~3#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571: havoc main_~node1____CPAchecker_TMP_0~2#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-10 00:00:56,256 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1968: havoc main_~node4____CPAchecker_TMP_0~4#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,259 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1837: havoc main_~node1____CPAchecker_TMP_0~3#1; [2024-11-10 00:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;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:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;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:00:56,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;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:00:56,262 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;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:00:56,262 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc main_~node1__m1~2#1;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:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2103: havoc main_~node1____CPAchecker_TMP_0~4#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-10 00:00:56,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1481: havoc main_~node3____CPAchecker_TMP_0~2#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: havoc main_~node3____CPAchecker_TMP_0~3#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2013: havoc main_~node3____CPAchecker_TMP_0~4#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~node5____CPAchecker_TMP_0~0#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-10 00:00:56,264 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-10 00:00:56,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-10 00:00:56,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125: havoc main_~node5____CPAchecker_TMP_0~1#1; [2024-11-10 00:00:56,367 INFO L? ?]: Removed 191 outVars from TransFormulas that were not future-live. [2024-11-10 00:00:56,367 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:00:56,400 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:00:56,401 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:00:56,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:00:56 BoogieIcfgContainer [2024-11-10 00:00:56,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:00:56,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:00:56,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:00:56,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:00:56,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:00:53" (1/3) ... [2024-11-10 00:00:56,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c91b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:00:56, skipping insertion in model container [2024-11-10 00:00:56,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:00:54" (2/3) ... [2024-11-10 00:00:56,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c91b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:00:56, skipping insertion in model container [2024-11-10 00:00:56,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:00:56" (3/3) ... [2024-11-10 00:00:56,411 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2024-11-10 00:00:56,433 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:00:56,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:00:56,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:00:56,512 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;@4cecdb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:00:56,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:00:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 375 states have (on average 1.5813333333333333) internal successors, (593), 376 states have internal predecessors, (593), 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:00:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 00:00:56,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:56,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] [2024-11-10 00:00:56,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:56,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -477036013, now seen corresponding path program 1 times [2024-11-10 00:00:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392328280] [2024-11-10 00:00:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:57,335 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:00:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392328280] [2024-11-10 00:00:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392328280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:57,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:00:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33521485] [2024-11-10 00:00:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:57,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:00:57,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:00:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:00:57,383 INFO L87 Difference]: Start difference. First operand has 377 states, 375 states have (on average 1.5813333333333333) internal successors, (593), 376 states have internal predecessors, (593), 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 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:00:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:57,574 INFO L93 Difference]: Finished difference Result 721 states and 1122 transitions. [2024-11-10 00:00:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:00:57,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 127 [2024-11-10 00:00:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:57,592 INFO L225 Difference]: With dead ends: 721 [2024-11-10 00:00:57,592 INFO L226 Difference]: Without dead ends: 373 [2024-11-10 00:00:57,597 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:00:57,600 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 126 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:57,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1615 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:00:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-10 00:00:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-10 00:00:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.4731182795698925) internal successors, (548), 372 states have internal predecessors, (548), 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:00:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 548 transitions. [2024-11-10 00:00:57,654 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 548 transitions. Word has length 127 [2024-11-10 00:00:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:57,655 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 548 transitions. [2024-11-10 00:00:57,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:00:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 548 transitions. [2024-11-10 00:00:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 00:00:57,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:57,660 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] [2024-11-10 00:00:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:00:57,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1062928487, now seen corresponding path program 1 times [2024-11-10 00:00:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126951610] [2024-11-10 00:00:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:57,948 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:00:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126951610] [2024-11-10 00:00:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126951610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175364521] [2024-11-10 00:00:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:57,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:57,958 INFO L87 Difference]: Start difference. First operand 373 states and 548 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:00:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:58,030 INFO L93 Difference]: Finished difference Result 884 states and 1347 transitions. [2024-11-10 00:00:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:58,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 187 [2024-11-10 00:00:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:58,036 INFO L225 Difference]: With dead ends: 884 [2024-11-10 00:00:58,036 INFO L226 Difference]: Without dead ends: 582 [2024-11-10 00:00:58,037 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:00:58,039 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 355 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:58,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 971 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-10 00:00:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2024-11-10 00:00:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4991364421416236) internal successors, (868), 579 states have internal predecessors, (868), 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:00:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 868 transitions. [2024-11-10 00:00:58,067 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 868 transitions. Word has length 187 [2024-11-10 00:00:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:58,068 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 868 transitions. [2024-11-10 00:00:58,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:00:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 868 transitions. [2024-11-10 00:00:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 00:00:58,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:58,073 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] [2024-11-10 00:00:58,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:00:58,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -685896725, now seen corresponding path program 1 times [2024-11-10 00:00:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75061959] [2024-11-10 00:00:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:58,287 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:00:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:58,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75061959] [2024-11-10 00:00:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75061959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:58,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547430315] [2024-11-10 00:00:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:58,293 INFO L87 Difference]: Start difference. First operand 580 states and 868 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:00:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:58,357 INFO L93 Difference]: Finished difference Result 1459 states and 2236 transitions. [2024-11-10 00:00:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 190 [2024-11-10 00:00:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:58,363 INFO L225 Difference]: With dead ends: 1459 [2024-11-10 00:00:58,364 INFO L226 Difference]: Without dead ends: 956 [2024-11-10 00:00:58,366 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:00:58,369 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 342 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:58,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 951 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-10 00:00:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 954. [2024-11-10 00:00:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 1.5131164742917105) internal successors, (1442), 953 states have internal predecessors, (1442), 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:00:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1442 transitions. [2024-11-10 00:00:58,428 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1442 transitions. Word has length 190 [2024-11-10 00:00:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:58,431 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1442 transitions. [2024-11-10 00:00:58,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:00:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1442 transitions. [2024-11-10 00:00:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 00:00:58,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:58,441 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:00:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:00:58,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1608974374, now seen corresponding path program 1 times [2024-11-10 00:00:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269834853] [2024-11-10 00:00:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:58,630 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:00:58,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269834853] [2024-11-10 00:00:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269834853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616741128] [2024-11-10 00:00:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:58,640 INFO L87 Difference]: Start difference. First operand 954 states and 1442 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:00:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:58,696 INFO L93 Difference]: Finished difference Result 2491 states and 3816 transitions. [2024-11-10 00:00:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:58,697 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:00:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:58,704 INFO L225 Difference]: With dead ends: 2491 [2024-11-10 00:00:58,704 INFO L226 Difference]: Without dead ends: 1620 [2024-11-10 00:00:58,706 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:00:58,707 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 328 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:58,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1013 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2024-11-10 00:00:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1618. [2024-11-10 00:00:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1617 states have (on average 1.5151515151515151) internal successors, (2450), 1617 states have internal predecessors, (2450), 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:00:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2450 transitions. [2024-11-10 00:00:58,794 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2450 transitions. Word has length 193 [2024-11-10 00:00:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2450 transitions. [2024-11-10 00:00:58,795 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:00:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2450 transitions. [2024-11-10 00:00:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 00:00:58,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:58,801 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] [2024-11-10 00:00:58,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:00:58,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1056785873, now seen corresponding path program 1 times [2024-11-10 00:00:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202042652] [2024-11-10 00:00:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:58,953 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:00:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202042652] [2024-11-10 00:00:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202042652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:58,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551233580] [2024-11-10 00:00:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:58,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:58,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:58,958 INFO L87 Difference]: Start difference. First operand 1618 states and 2450 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:59,027 INFO L93 Difference]: Finished difference Result 4305 states and 6556 transitions. [2024-11-10 00:00:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 196 [2024-11-10 00:00:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:59,040 INFO L225 Difference]: With dead ends: 4305 [2024-11-10 00:00:59,040 INFO L226 Difference]: Without dead ends: 2776 [2024-11-10 00:00:59,044 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:00:59,046 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 316 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:59,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 911 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:59,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2024-11-10 00:00:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2774. [2024-11-10 00:00:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2773 states have (on average 1.5066714749368915) internal successors, (4178), 2773 states have internal predecessors, (4178), 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:00:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4178 transitions. [2024-11-10 00:00:59,115 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 4178 transitions. Word has length 196 [2024-11-10 00:00:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:59,117 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 4178 transitions. [2024-11-10 00:00:59,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:00:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 4178 transitions. [2024-11-10 00:00:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 00:00:59,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:59,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:00:59,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:00:59,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:59,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash -854648087, now seen corresponding path program 1 times [2024-11-10 00:00:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385499472] [2024-11-10 00:00:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:59,261 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:00:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:59,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385499472] [2024-11-10 00:00:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385499472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:00:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702059424] [2024-11-10 00:00:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:00:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:00:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:00:59,266 INFO L87 Difference]: Start difference. First operand 2774 states and 4178 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:00:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:00:59,352 INFO L93 Difference]: Finished difference Result 7419 states and 11172 transitions. [2024-11-10 00:00:59,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:00:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 199 [2024-11-10 00:00:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:00:59,373 INFO L225 Difference]: With dead ends: 7419 [2024-11-10 00:00:59,373 INFO L226 Difference]: Without dead ends: 4740 [2024-11-10 00:00:59,380 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:00:59,381 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 302 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:00:59,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 973 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:00:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2024-11-10 00:00:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 4738. [2024-11-10 00:00:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4738 states, 4737 states have (on average 1.4882837238758708) internal successors, (7050), 4737 states have internal predecessors, (7050), 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:00:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 7050 transitions. [2024-11-10 00:00:59,518 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 7050 transitions. Word has length 199 [2024-11-10 00:00:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:00:59,518 INFO L471 AbstractCegarLoop]: Abstraction has 4738 states and 7050 transitions. [2024-11-10 00:00:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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:00:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 7050 transitions. [2024-11-10 00:00:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 00:00:59,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:00:59,532 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, 1, 1] [2024-11-10 00:00:59,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:00:59,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:00:59,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:00:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash -186228220, now seen corresponding path program 1 times [2024-11-10 00:00:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:00:59,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736447773] [2024-11-10 00:00:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:00:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:00:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:00:59,801 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:00:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:00:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736447773] [2024-11-10 00:00:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736447773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:00:59,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:00:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:00:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090172370] [2024-11-10 00:00:59,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:00:59,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:00:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:00:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:00:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:00:59,803 INFO L87 Difference]: Start difference. First operand 4738 states and 7050 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 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:01:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:00,743 INFO L93 Difference]: Finished difference Result 43417 states and 64391 transitions. [2024-11-10 00:01:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:01:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 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 202 [2024-11-10 00:01:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:00,878 INFO L225 Difference]: With dead ends: 43417 [2024-11-10 00:01:00,879 INFO L226 Difference]: Without dead ends: 38781 [2024-11-10 00:01:00,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:01:00,908 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 3211 mSDsluCounter, 5373 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 6984 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:00,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3211 Valid, 6984 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38781 states. [2024-11-10 00:01:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38781 to 9307. [2024-11-10 00:01:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9307 states, 9306 states have (on average 1.463571889103804) internal successors, (13620), 9306 states have internal predecessors, (13620), 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:01:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9307 states to 9307 states and 13620 transitions. [2024-11-10 00:01:01,585 INFO L78 Accepts]: Start accepts. Automaton has 9307 states and 13620 transitions. Word has length 202 [2024-11-10 00:01:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 9307 states and 13620 transitions. [2024-11-10 00:01:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 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:01:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9307 states and 13620 transitions. [2024-11-10 00:01:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-10 00:01:01,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:01,607 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:01,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:01:01,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:01,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 410489463, now seen corresponding path program 1 times [2024-11-10 00:01:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:01,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340058609] [2024-11-10 00:01:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:01,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:02,106 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:01:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340058609] [2024-11-10 00:01:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340058609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:02,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:02,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873967349] [2024-11-10 00:01:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:02,110 INFO L87 Difference]: Start difference. First operand 9307 states and 13620 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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:01:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:02,588 INFO L93 Difference]: Finished difference Result 18513 states and 27125 transitions. [2024-11-10 00:01:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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 207 [2024-11-10 00:01:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:02,607 INFO L225 Difference]: With dead ends: 18513 [2024-11-10 00:01:02,607 INFO L226 Difference]: Without dead ends: 9309 [2024-11-10 00:01:02,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:02,619 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1155 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:02,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2119 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9309 states. [2024-11-10 00:01:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9309 to 9307. [2024-11-10 00:01:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9307 states, 9306 states have (on average 1.4497098646034816) internal successors, (13491), 9306 states have internal predecessors, (13491), 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:01:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9307 states to 9307 states and 13491 transitions. [2024-11-10 00:01:02,790 INFO L78 Accepts]: Start accepts. Automaton has 9307 states and 13491 transitions. Word has length 207 [2024-11-10 00:01:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:02,791 INFO L471 AbstractCegarLoop]: Abstraction has 9307 states and 13491 transitions. [2024-11-10 00:01:02,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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:01:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 9307 states and 13491 transitions. [2024-11-10 00:01:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 00:01:02,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:02,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:02,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:01:02,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:02,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 183474490, now seen corresponding path program 1 times [2024-11-10 00:01:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841939916] [2024-11-10 00:01:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:02,947 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:01:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:02,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841939916] [2024-11-10 00:01:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841939916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015424957] [2024-11-10 00:01:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:02,951 INFO L87 Difference]: Start difference. First operand 9307 states and 13491 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:01:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:03,185 INFO L93 Difference]: Finished difference Result 22095 states and 32095 transitions. [2024-11-10 00:01:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 209 [2024-11-10 00:01:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:03,210 INFO L225 Difference]: With dead ends: 22095 [2024-11-10 00:01:03,211 INFO L226 Difference]: Without dead ends: 12887 [2024-11-10 00:01:03,222 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:01:03,223 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 362 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:03,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12887 states. [2024-11-10 00:01:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12887 to 12885. [2024-11-10 00:01:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12885 states, 12884 states have (on average 1.437441788264514) internal successors, (18520), 12884 states have internal predecessors, (18520), 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:01:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 18520 transitions. [2024-11-10 00:01:03,471 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 18520 transitions. Word has length 209 [2024-11-10 00:01:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:03,471 INFO L471 AbstractCegarLoop]: Abstraction has 12885 states and 18520 transitions. [2024-11-10 00:01:03,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:01:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 18520 transitions. [2024-11-10 00:01:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:01:03,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:03,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:03,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:01:03,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 171776381, now seen corresponding path program 1 times [2024-11-10 00:01:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:03,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924793699] [2024-11-10 00:01:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:03,953 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:01:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924793699] [2024-11-10 00:01:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924793699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646515516] [2024-11-10 00:01:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:03,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:03,956 INFO L87 Difference]: Start difference. First operand 12885 states and 18520 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:04,796 INFO L93 Difference]: Finished difference Result 65742 states and 94025 transitions. [2024-11-10 00:01:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:04,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 210 [2024-11-10 00:01:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:05,054 INFO L225 Difference]: With dead ends: 65742 [2024-11-10 00:01:05,055 INFO L226 Difference]: Without dead ends: 57092 [2024-11-10 00:01:05,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:05,078 INFO L432 NwaCegarLoop]: 1170 mSDtfsCounter, 2580 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2580 SdHoareTripleChecker+Valid, 4506 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:05,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2580 Valid, 4506 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:01:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57092 states. [2024-11-10 00:01:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57092 to 24385. [2024-11-10 00:01:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24385 states, 24384 states have (on average 1.428231627296588) internal successors, (34826), 24384 states have internal predecessors, (34826), 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:01:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24385 states to 24385 states and 34826 transitions. [2024-11-10 00:01:05,852 INFO L78 Accepts]: Start accepts. Automaton has 24385 states and 34826 transitions. Word has length 210 [2024-11-10 00:01:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:05,852 INFO L471 AbstractCegarLoop]: Abstraction has 24385 states and 34826 transitions. [2024-11-10 00:01:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 24385 states and 34826 transitions. [2024-11-10 00:01:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:01:05,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:05,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:05,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:01:05,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:05,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash 174855637, now seen corresponding path program 1 times [2024-11-10 00:01:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007029829] [2024-11-10 00:01:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:06,220 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:01:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007029829] [2024-11-10 00:01:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007029829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446675815] [2024-11-10 00:01:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:06,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:06,223 INFO L87 Difference]: Start difference. First operand 24385 states and 34826 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:07,297 INFO L93 Difference]: Finished difference Result 75726 states and 108113 transitions. [2024-11-10 00:01:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 210 [2024-11-10 00:01:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:07,461 INFO L225 Difference]: With dead ends: 75726 [2024-11-10 00:01:07,461 INFO L226 Difference]: Without dead ends: 67364 [2024-11-10 00:01:07,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:07,498 INFO L432 NwaCegarLoop]: 999 mSDtfsCounter, 2923 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2923 SdHoareTripleChecker+Valid, 3762 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:07,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2923 Valid, 3762 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:01:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67364 states. [2024-11-10 00:01:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67364 to 39851. [2024-11-10 00:01:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39851 states, 39850 states have (on average 1.4186449184441656) internal successors, (56533), 39850 states have internal predecessors, (56533), 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:01:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39851 states to 39851 states and 56533 transitions. [2024-11-10 00:01:08,510 INFO L78 Accepts]: Start accepts. Automaton has 39851 states and 56533 transitions. Word has length 210 [2024-11-10 00:01:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:08,510 INFO L471 AbstractCegarLoop]: Abstraction has 39851 states and 56533 transitions. [2024-11-10 00:01:08,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39851 states and 56533 transitions. [2024-11-10 00:01:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:01:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:08,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:01:08,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash 982288986, now seen corresponding path program 1 times [2024-11-10 00:01:08,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:08,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266554291] [2024-11-10 00:01:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:09,092 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:01:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266554291] [2024-11-10 00:01:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266554291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346731615] [2024-11-10 00:01:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:09,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:09,096 INFO L87 Difference]: Start difference. First operand 39851 states and 56533 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:09,889 INFO L93 Difference]: Finished difference Result 85454 states and 121833 transitions. [2024-11-10 00:01:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 210 [2024-11-10 00:01:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:10,168 INFO L225 Difference]: With dead ends: 85454 [2024-11-10 00:01:10,168 INFO L226 Difference]: Without dead ends: 76948 [2024-11-10 00:01:10,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:10,199 INFO L432 NwaCegarLoop]: 1423 mSDtfsCounter, 2489 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 4564 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:10,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 4564 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:01:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76948 states. [2024-11-10 00:01:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76948 to 50348. [2024-11-10 00:01:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50348 states, 50347 states have (on average 1.4178600512443642) internal successors, (71385), 50347 states have internal predecessors, (71385), 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:01:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50348 states to 50348 states and 71385 transitions. [2024-11-10 00:01:11,294 INFO L78 Accepts]: Start accepts. Automaton has 50348 states and 71385 transitions. Word has length 210 [2024-11-10 00:01:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:11,295 INFO L471 AbstractCegarLoop]: Abstraction has 50348 states and 71385 transitions. [2024-11-10 00:01:11,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50348 states and 71385 transitions. [2024-11-10 00:01:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:01:11,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:11,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:11,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:01:11,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2029812341, now seen corresponding path program 1 times [2024-11-10 00:01:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144381746] [2024-11-10 00:01:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:11,941 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:01:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144381746] [2024-11-10 00:01:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144381746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966396631] [2024-11-10 00:01:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:11,945 INFO L87 Difference]: Start difference. First operand 50348 states and 71385 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:12,951 INFO L93 Difference]: Finished difference Result 96430 states and 137407 transitions. [2024-11-10 00:01:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 210 [2024-11-10 00:01:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:13,092 INFO L225 Difference]: With dead ends: 96430 [2024-11-10 00:01:13,093 INFO L226 Difference]: Without dead ends: 87636 [2024-11-10 00:01:13,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:13,129 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 2240 mSDsluCounter, 4500 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:13,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 6091 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87636 states. [2024-11-10 00:01:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87636 to 61157. [2024-11-10 00:01:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61157 states, 61156 states have (on average 1.4178657858591144) internal successors, (86711), 61156 states have internal predecessors, (86711), 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:01:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61157 states to 61157 states and 86711 transitions. [2024-11-10 00:01:14,312 INFO L78 Accepts]: Start accepts. Automaton has 61157 states and 86711 transitions. Word has length 210 [2024-11-10 00:01:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:14,313 INFO L471 AbstractCegarLoop]: Abstraction has 61157 states and 86711 transitions. [2024-11-10 00:01:14,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 61157 states and 86711 transitions. [2024-11-10 00:01:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 00:01:14,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:14,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:14,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:01:14,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:14,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1271400222, now seen corresponding path program 1 times [2024-11-10 00:01:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:14,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922563820] [2024-11-10 00:01:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:14,754 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:01:14,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:14,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922563820] [2024-11-10 00:01:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922563820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:14,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:14,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:01:14,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520230528] [2024-11-10 00:01:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:14,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:01:14,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:01:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:01:14,759 INFO L87 Difference]: Start difference. First operand 61157 states and 86711 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:15,664 INFO L93 Difference]: Finished difference Result 101395 states and 144515 transitions. [2024-11-10 00:01:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:01:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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 210 [2024-11-10 00:01:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:15,801 INFO L225 Difference]: With dead ends: 101395 [2024-11-10 00:01:15,802 INFO L226 Difference]: Without dead ends: 95281 [2024-11-10 00:01:15,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:01:15,848 INFO L432 NwaCegarLoop]: 1426 mSDtfsCounter, 2546 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2546 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:15,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2546 Valid, 4423 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95281 states. [2024-11-10 00:01:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95281 to 68802. [2024-11-10 00:01:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68802 states, 68801 states have (on average 1.4193253005043531) internal successors, (97651), 68801 states have internal predecessors, (97651), 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:01:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68802 states to 68802 states and 97651 transitions. [2024-11-10 00:01:17,281 INFO L78 Accepts]: Start accepts. Automaton has 68802 states and 97651 transitions. Word has length 210 [2024-11-10 00:01:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:17,281 INFO L471 AbstractCegarLoop]: Abstraction has 68802 states and 97651 transitions. [2024-11-10 00:01:17,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 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:01:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 68802 states and 97651 transitions. [2024-11-10 00:01:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:17,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:17,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:01:17,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:17,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 231011929, now seen corresponding path program 1 times [2024-11-10 00:01:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:17,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416172680] [2024-11-10 00:01:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:17,473 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:01:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416172680] [2024-11-10 00:01:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416172680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360341555] [2024-11-10 00:01:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:17,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:17,476 INFO L87 Difference]: Start difference. First operand 68802 states and 97651 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:18,820 INFO L93 Difference]: Finished difference Result 200624 states and 284454 transitions. [2024-11-10 00:01:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:18,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:19,129 INFO L225 Difference]: With dead ends: 200624 [2024-11-10 00:01:19,130 INFO L226 Difference]: Without dead ends: 136696 [2024-11-10 00:01:19,212 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:01:19,213 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 318 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:19,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 638 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:01:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136696 states. [2024-11-10 00:01:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136696 to 136694. [2024-11-10 00:01:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136694 states, 136693 states have (on average 1.4099697863094671) internal successors, (192733), 136693 states have internal predecessors, (192733), 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:01:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136694 states to 136694 states and 192733 transitions. [2024-11-10 00:01:21,770 INFO L78 Accepts]: Start accepts. Automaton has 136694 states and 192733 transitions. Word has length 212 [2024-11-10 00:01:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:21,770 INFO L471 AbstractCegarLoop]: Abstraction has 136694 states and 192733 transitions. [2024-11-10 00:01:21,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 136694 states and 192733 transitions. [2024-11-10 00:01:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:21,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:21,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:01:21,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 431562074, now seen corresponding path program 1 times [2024-11-10 00:01:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739203898] [2024-11-10 00:01:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:21,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:22,125 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:01:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739203898] [2024-11-10 00:01:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739203898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:22,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:22,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118877730] [2024-11-10 00:01:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:22,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:22,129 INFO L87 Difference]: Start difference. First operand 136694 states and 192733 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:23,366 INFO L93 Difference]: Finished difference Result 186442 states and 264559 transitions. [2024-11-10 00:01:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:23,453 INFO L225 Difference]: With dead ends: 186442 [2024-11-10 00:01:23,454 INFO L226 Difference]: Without dead ends: 69073 [2024-11-10 00:01:23,531 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:01:23,531 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 198 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:23,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 802 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69073 states. [2024-11-10 00:01:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69073 to 69071. [2024-11-10 00:01:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69071 states, 69070 states have (on average 1.417576371796728) internal successors, (97912), 69070 states have internal predecessors, (97912), 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:01:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69071 states to 69071 states and 97912 transitions. [2024-11-10 00:01:24,956 INFO L78 Accepts]: Start accepts. Automaton has 69071 states and 97912 transitions. Word has length 212 [2024-11-10 00:01:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:24,956 INFO L471 AbstractCegarLoop]: Abstraction has 69071 states and 97912 transitions. [2024-11-10 00:01:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 69071 states and 97912 transitions. [2024-11-10 00:01:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:24,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:24,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:24,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:01:24,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:25,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1870710973, now seen corresponding path program 1 times [2024-11-10 00:01:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:25,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456795871] [2024-11-10 00:01:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:25,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:25,169 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:01:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456795871] [2024-11-10 00:01:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456795871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213729568] [2024-11-10 00:01:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:25,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:25,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:25,172 INFO L87 Difference]: Start difference. First operand 69071 states and 97912 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:25,905 INFO L93 Difference]: Finished difference Result 98921 states and 140542 transitions. [2024-11-10 00:01:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:25,961 INFO L225 Difference]: With dead ends: 98921 [2024-11-10 00:01:25,961 INFO L226 Difference]: Without dead ends: 35277 [2024-11-10 00:01:25,981 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:01:25,982 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 184 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:25,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 757 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35277 states. [2024-11-10 00:01:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35277 to 35275. [2024-11-10 00:01:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35275 states, 35274 states have (on average 1.4072121109032147) internal successors, (49638), 35274 states have internal predecessors, (49638), 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:01:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35275 states to 35275 states and 49638 transitions. [2024-11-10 00:01:26,465 INFO L78 Accepts]: Start accepts. Automaton has 35275 states and 49638 transitions. Word has length 212 [2024-11-10 00:01:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:26,465 INFO L471 AbstractCegarLoop]: Abstraction has 35275 states and 49638 transitions. [2024-11-10 00:01:26,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35275 states and 49638 transitions. [2024-11-10 00:01:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:26,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:26,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:26,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:01:26,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1069486937, now seen corresponding path program 1 times [2024-11-10 00:01:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:26,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693380402] [2024-11-10 00:01:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:26,657 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:01:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693380402] [2024-11-10 00:01:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693380402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740357816] [2024-11-10 00:01:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:26,659 INFO L87 Difference]: Start difference. First operand 35275 states and 49638 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:26,784 INFO L93 Difference]: Finished difference Result 49449 states and 69770 transitions. [2024-11-10 00:01:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:26,805 INFO L225 Difference]: With dead ends: 49449 [2024-11-10 00:01:26,805 INFO L226 Difference]: Without dead ends: 18103 [2024-11-10 00:01:26,826 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:01:26,826 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 179 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:26,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 720 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:26,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18103 states. [2024-11-10 00:01:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18103 to 18101. [2024-11-10 00:01:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18101 states, 18100 states have (on average 1.3952486187845303) internal successors, (25254), 18100 states have internal predecessors, (25254), 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:01:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18101 states to 18101 states and 25254 transitions. [2024-11-10 00:01:27,386 INFO L78 Accepts]: Start accepts. Automaton has 18101 states and 25254 transitions. Word has length 212 [2024-11-10 00:01:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 18101 states and 25254 transitions. [2024-11-10 00:01:27,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18101 states and 25254 transitions. [2024-11-10 00:01:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:27,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:27,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:01:27,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash -848105187, now seen corresponding path program 1 times [2024-11-10 00:01:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:27,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863060630] [2024-11-10 00:01:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:27,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:27,501 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:01:27,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863060630] [2024-11-10 00:01:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863060630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904206827] [2024-11-10 00:01:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:27,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:27,503 INFO L87 Difference]: Start difference. First operand 18101 states and 25254 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:27,862 INFO L93 Difference]: Finished difference Result 50689 states and 70716 transitions. [2024-11-10 00:01:27,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:27,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:27,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:27,902 INFO L225 Difference]: With dead ends: 50689 [2024-11-10 00:01:27,902 INFO L226 Difference]: Without dead ends: 35913 [2024-11-10 00:01:27,921 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:01:27,922 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 276 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:27,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 574 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35913 states. [2024-11-10 00:01:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35913 to 35911. [2024-11-10 00:01:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35911 states, 35910 states have (on average 1.3872458925090505) internal successors, (49816), 35910 states have internal predecessors, (49816), 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:01:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35911 states to 35911 states and 49816 transitions. [2024-11-10 00:01:28,698 INFO L78 Accepts]: Start accepts. Automaton has 35911 states and 49816 transitions. Word has length 212 [2024-11-10 00:01:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:28,698 INFO L471 AbstractCegarLoop]: Abstraction has 35911 states and 49816 transitions. [2024-11-10 00:01:28,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 35911 states and 49816 transitions. [2024-11-10 00:01:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:28,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:28,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:01:28,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 491939102, now seen corresponding path program 1 times [2024-11-10 00:01:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937363180] [2024-11-10 00:01:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:28,970 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:01:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937363180] [2024-11-10 00:01:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937363180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:28,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636273461] [2024-11-10 00:01:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:28,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:28,974 INFO L87 Difference]: Start difference. First operand 35911 states and 49816 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:29,124 INFO L93 Difference]: Finished difference Result 50559 states and 70306 transitions. [2024-11-10 00:01:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:29,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:29,153 INFO L225 Difference]: With dead ends: 50559 [2024-11-10 00:01:29,153 INFO L226 Difference]: Without dead ends: 18413 [2024-11-10 00:01:29,177 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:01:29,178 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 164 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:29,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 669 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18413 states. [2024-11-10 00:01:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18413 to 18411. [2024-11-10 00:01:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18411 states, 18410 states have (on average 1.375556762629006) internal successors, (25324), 18410 states have internal predecessors, (25324), 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:01:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 25324 transitions. [2024-11-10 00:01:29,464 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 25324 transitions. Word has length 212 [2024-11-10 00:01:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 18411 states and 25324 transitions. [2024-11-10 00:01:29,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 25324 transitions. [2024-11-10 00:01:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:29,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:29,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:01:29,483 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:29,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 397360256, now seen corresponding path program 1 times [2024-11-10 00:01:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732143748] [2024-11-10 00:01:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:29,727 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:01:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732143748] [2024-11-10 00:01:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732143748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:29,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251882814] [2024-11-10 00:01:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:29,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:29,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:29,732 INFO L87 Difference]: Start difference. First operand 18411 states and 25324 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:29,837 INFO L93 Difference]: Finished difference Result 25271 states and 34922 transitions. [2024-11-10 00:01:29,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:29,850 INFO L225 Difference]: With dead ends: 25271 [2024-11-10 00:01:29,851 INFO L226 Difference]: Without dead ends: 9629 [2024-11-10 00:01:29,864 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:01:29,865 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 156 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:29,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 622 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:01:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9629 states. [2024-11-10 00:01:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9629 to 9627. [2024-11-10 00:01:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9627 states, 9626 states have (on average 1.3621441928111364) internal successors, (13112), 9626 states have internal predecessors, (13112), 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:01:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 13112 transitions. [2024-11-10 00:01:30,162 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 13112 transitions. Word has length 212 [2024-11-10 00:01:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:30,162 INFO L471 AbstractCegarLoop]: Abstraction has 9627 states and 13112 transitions. [2024-11-10 00:01:30,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:01:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 13112 transitions. [2024-11-10 00:01:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-10 00:01:30,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:30,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:01:30,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1168477720, now seen corresponding path program 1 times [2024-11-10 00:01:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153229104] [2024-11-10 00:01:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:30,687 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:01:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153229104] [2024-11-10 00:01:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153229104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756536393] [2024-11-10 00:01:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:30,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:30,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:30,691 INFO L87 Difference]: Start difference. First operand 9627 states and 13112 transitions. Second operand has 10 states, 10 states have (on average 21.2) internal successors, (212), 9 states have internal predecessors, (212), 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:01:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:31,564 INFO L93 Difference]: Finished difference Result 22563 states and 30874 transitions. [2024-11-10 00:01:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.2) internal successors, (212), 9 states have internal predecessors, (212), 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 212 [2024-11-10 00:01:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:31,585 INFO L225 Difference]: With dead ends: 22563 [2024-11-10 00:01:31,585 INFO L226 Difference]: Without dead ends: 14064 [2024-11-10 00:01:31,595 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:01:31,596 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 968 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:31,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1594 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14064 states. [2024-11-10 00:01:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14064 to 10445. [2024-11-10 00:01:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10445 states, 10444 states have (on average 1.3603983148219072) internal successors, (14208), 10444 states have internal predecessors, (14208), 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:01:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10445 states to 10445 states and 14208 transitions. [2024-11-10 00:01:31,745 INFO L78 Accepts]: Start accepts. Automaton has 10445 states and 14208 transitions. Word has length 212 [2024-11-10 00:01:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:31,745 INFO L471 AbstractCegarLoop]: Abstraction has 10445 states and 14208 transitions. [2024-11-10 00:01:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.2) internal successors, (212), 9 states have internal predecessors, (212), 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:01:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 10445 states and 14208 transitions. [2024-11-10 00:01:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 00:01:31,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:31,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:01:31,754 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash 26507073, now seen corresponding path program 1 times [2024-11-10 00:01:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722246579] [2024-11-10 00:01:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:31,886 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:01:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722246579] [2024-11-10 00:01:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722246579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:01:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235433672] [2024-11-10 00:01:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:31,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:01:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:01:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:01:31,889 INFO L87 Difference]: Start difference. First operand 10445 states and 14208 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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:01:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:32,146 INFO L93 Difference]: Finished difference Result 15211 states and 20732 transitions. [2024-11-10 00:01:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:01:32,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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 213 [2024-11-10 00:01:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:32,158 INFO L225 Difference]: With dead ends: 15211 [2024-11-10 00:01:32,159 INFO L226 Difference]: Without dead ends: 9523 [2024-11-10 00:01:32,165 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:01:32,166 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 269 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:32,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 672 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:01:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9523 states. [2024-11-10 00:01:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9523 to 9521. [2024-11-10 00:01:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9521 states, 9520 states have (on average 1.353781512605042) internal successors, (12888), 9520 states have internal predecessors, (12888), 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:01:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9521 states to 9521 states and 12888 transitions. [2024-11-10 00:01:32,269 INFO L78 Accepts]: Start accepts. Automaton has 9521 states and 12888 transitions. Word has length 213 [2024-11-10 00:01:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 9521 states and 12888 transitions. [2024-11-10 00:01:32,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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:01:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9521 states and 12888 transitions. [2024-11-10 00:01:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 00:01:32,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:32,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:32,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:01:32,278 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1366551362, now seen corresponding path program 1 times [2024-11-10 00:01:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686083641] [2024-11-10 00:01:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:32,776 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:01:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686083641] [2024-11-10 00:01:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686083641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038468512] [2024-11-10 00:01:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:32,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:32,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:32,779 INFO L87 Difference]: Start difference. First operand 9521 states and 12888 transitions. Second operand has 10 states, 10 states have (on average 21.3) internal successors, (213), 9 states have internal predecessors, (213), 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:01:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:33,600 INFO L93 Difference]: Finished difference Result 30514 states and 41139 transitions. [2024-11-10 00:01:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:33,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 9 states have internal predecessors, (213), 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 213 [2024-11-10 00:01:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:33,625 INFO L225 Difference]: With dead ends: 30514 [2024-11-10 00:01:33,625 INFO L226 Difference]: Without dead ends: 21062 [2024-11-10 00:01:33,637 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:01:33,637 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1187 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:33,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1199 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2024-11-10 00:01:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 20823. [2024-11-10 00:01:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20823 states, 20822 states have (on average 1.3389203726827394) internal successors, (27879), 20822 states have internal predecessors, (27879), 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:01:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20823 states to 20823 states and 27879 transitions. [2024-11-10 00:01:33,894 INFO L78 Accepts]: Start accepts. Automaton has 20823 states and 27879 transitions. Word has length 213 [2024-11-10 00:01:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:33,894 INFO L471 AbstractCegarLoop]: Abstraction has 20823 states and 27879 transitions. [2024-11-10 00:01:33,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 9 states have internal predecessors, (213), 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:01:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20823 states and 27879 transitions. [2024-11-10 00:01:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 00:01:33,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:33,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:33,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:01:33,910 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1918859583, now seen corresponding path program 1 times [2024-11-10 00:01:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272358874] [2024-11-10 00:01:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:34,908 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:01:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272358874] [2024-11-10 00:01:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272358874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:01:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393159833] [2024-11-10 00:01:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:01:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:34,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:01:34,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:01:34,911 INFO L87 Difference]: Start difference. First operand 20823 states and 27879 transitions. Second operand has 12 states, 12 states have (on average 17.833333333333332) internal successors, (214), 11 states have internal predecessors, (214), 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:01:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:36,273 INFO L93 Difference]: Finished difference Result 41149 states and 55417 transitions. [2024-11-10 00:01:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:01:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 17.833333333333332) internal successors, (214), 11 states have internal predecessors, (214), 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 214 [2024-11-10 00:01:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:36,306 INFO L225 Difference]: With dead ends: 41149 [2024-11-10 00:01:36,306 INFO L226 Difference]: Without dead ends: 31383 [2024-11-10 00:01:36,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-10 00:01:36,321 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1655 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:36,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 2419 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:01:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31383 states. [2024-11-10 00:01:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31383 to 19102. [2024-11-10 00:01:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19102 states, 19101 states have (on average 1.3452698811580546) internal successors, (25696), 19101 states have internal predecessors, (25696), 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:01:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19102 states to 19102 states and 25696 transitions. [2024-11-10 00:01:36,646 INFO L78 Accepts]: Start accepts. Automaton has 19102 states and 25696 transitions. Word has length 214 [2024-11-10 00:01:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:36,646 INFO L471 AbstractCegarLoop]: Abstraction has 19102 states and 25696 transitions. [2024-11-10 00:01:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.833333333333332) internal successors, (214), 11 states have internal predecessors, (214), 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:01:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19102 states and 25696 transitions. [2024-11-10 00:01:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 00:01:36,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:36,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:36,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:01:36,661 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash -282275730, now seen corresponding path program 1 times [2024-11-10 00:01:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495794514] [2024-11-10 00:01:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:37,219 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:01:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495794514] [2024-11-10 00:01:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495794514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394741897] [2024-11-10 00:01:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:37,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:37,222 INFO L87 Difference]: Start difference. First operand 19102 states and 25696 transitions. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 9 states have internal predecessors, (214), 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:01:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:38,148 INFO L93 Difference]: Finished difference Result 58106 states and 77814 transitions. [2024-11-10 00:01:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:01:38,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 9 states have internal predecessors, (214), 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 214 [2024-11-10 00:01:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:38,204 INFO L225 Difference]: With dead ends: 58106 [2024-11-10 00:01:38,204 INFO L226 Difference]: Without dead ends: 39109 [2024-11-10 00:01:38,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:01:38,231 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1599 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:38,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 1657 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2024-11-10 00:01:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 38545. [2024-11-10 00:01:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38545 states, 38544 states have (on average 1.3301421751764217) internal successors, (51269), 38544 states have internal predecessors, (51269), 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:01:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38545 states to 38545 states and 51269 transitions. [2024-11-10 00:01:39,044 INFO L78 Accepts]: Start accepts. Automaton has 38545 states and 51269 transitions. Word has length 214 [2024-11-10 00:01:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:39,045 INFO L471 AbstractCegarLoop]: Abstraction has 38545 states and 51269 transitions. [2024-11-10 00:01:39,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 9 states have internal predecessors, (214), 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:01:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38545 states and 51269 transitions. [2024-11-10 00:01:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:01:39,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:39,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, 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:01:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 00:01:39,076 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:39,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -886118469, now seen corresponding path program 1 times [2024-11-10 00:01:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153129398] [2024-11-10 00:01:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:39,480 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:01:39,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:39,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153129398] [2024-11-10 00:01:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153129398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:39,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:39,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:39,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230056942] [2024-11-10 00:01:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:39,483 INFO L87 Difference]: Start difference. First operand 38545 states and 51269 transitions. Second operand has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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:01:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:40,329 INFO L93 Difference]: Finished difference Result 92213 states and 122706 transitions. [2024-11-10 00:01:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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 215 [2024-11-10 00:01:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:40,399 INFO L225 Difference]: With dead ends: 92213 [2024-11-10 00:01:40,399 INFO L226 Difference]: Without dead ends: 54134 [2024-11-10 00:01:40,436 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:01:40,437 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1801 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:40,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 1209 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:01:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54134 states. [2024-11-10 00:01:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54134 to 37266. [2024-11-10 00:01:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37266 states, 37265 states have (on average 1.3305246209580035) internal successors, (49582), 37265 states have internal predecessors, (49582), 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:01:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37266 states to 37266 states and 49582 transitions. [2024-11-10 00:01:41,269 INFO L78 Accepts]: Start accepts. Automaton has 37266 states and 49582 transitions. Word has length 215 [2024-11-10 00:01:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 37266 states and 49582 transitions. [2024-11-10 00:01:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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:01:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37266 states and 49582 transitions. [2024-11-10 00:01:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:01:41,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:41,297 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:41,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 00:01:41,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -708150821, now seen corresponding path program 1 times [2024-11-10 00:01:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077655146] [2024-11-10 00:01:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:42,546 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:01:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077655146] [2024-11-10 00:01:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077655146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:42,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:42,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 00:01:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052502694] [2024-11-10 00:01:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 00:01:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 00:01:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:01:42,550 INFO L87 Difference]: Start difference. First operand 37266 states and 49582 transitions. Second operand has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 16 states have internal predecessors, (215), 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:01:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:44,417 INFO L93 Difference]: Finished difference Result 68405 states and 91282 transitions. [2024-11-10 00:01:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 00:01:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 16 states have internal predecessors, (215), 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 215 [2024-11-10 00:01:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:44,492 INFO L225 Difference]: With dead ends: 68405 [2024-11-10 00:01:44,492 INFO L226 Difference]: Without dead ends: 54739 [2024-11-10 00:01:44,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1069, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:01:44,521 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1696 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2839 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:44,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2839 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:01:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54739 states. [2024-11-10 00:01:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54739 to 37467. [2024-11-10 00:01:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37467 states, 37466 states have (on average 1.3307532162493994) internal successors, (49858), 37466 states have internal predecessors, (49858), 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:01:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37467 states to 37467 states and 49858 transitions. [2024-11-10 00:01:45,374 INFO L78 Accepts]: Start accepts. Automaton has 37467 states and 49858 transitions. Word has length 215 [2024-11-10 00:01:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:45,375 INFO L471 AbstractCegarLoop]: Abstraction has 37467 states and 49858 transitions. [2024-11-10 00:01:45,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.647058823529411) internal successors, (215), 16 states have internal predecessors, (215), 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:01:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 37467 states and 49858 transitions. [2024-11-10 00:01:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:01:45,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:45,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:45,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 00:01:45,404 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:45,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2074173323, now seen corresponding path program 1 times [2024-11-10 00:01:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077685198] [2024-11-10 00:01:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:46,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:01:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077685198] [2024-11-10 00:01:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077685198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 00:01:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310441257] [2024-11-10 00:01:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 00:01:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:46,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 00:01:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:01:46,011 INFO L87 Difference]: Start difference. First operand 37467 states and 49858 transitions. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 13 states have internal predecessors, (215), 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:01:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:47,022 INFO L93 Difference]: Finished difference Result 111037 states and 147332 transitions. [2024-11-10 00:01:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 00:01:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 13 states have internal predecessors, (215), 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 215 [2024-11-10 00:01:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:47,317 INFO L225 Difference]: With dead ends: 111037 [2024-11-10 00:01:47,317 INFO L226 Difference]: Without dead ends: 73645 [2024-11-10 00:01:47,334 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:01:47,335 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1283 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:47,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 1815 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:01:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73645 states. [2024-11-10 00:01:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73645 to 71950. [2024-11-10 00:01:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71950 states, 71949 states have (on average 1.3275931562634644) internal successors, (95519), 71949 states have internal predecessors, (95519), 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:01:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71950 states to 71950 states and 95519 transitions. [2024-11-10 00:01:48,476 INFO L78 Accepts]: Start accepts. Automaton has 71950 states and 95519 transitions. Word has length 215 [2024-11-10 00:01:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:48,476 INFO L471 AbstractCegarLoop]: Abstraction has 71950 states and 95519 transitions. [2024-11-10 00:01:48,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 13 states have internal predecessors, (215), 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:01:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 71950 states and 95519 transitions. [2024-11-10 00:01:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:01:48,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:48,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:48,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 00:01:48,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash 780598054, now seen corresponding path program 1 times [2024-11-10 00:01:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:48,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551249237] [2024-11-10 00:01:48,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:49,241 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:01:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551249237] [2024-11-10 00:01:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551249237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:49,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 00:01:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758914516] [2024-11-10 00:01:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 00:01:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 00:01:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:01:49,244 INFO L87 Difference]: Start difference. First operand 71950 states and 95519 transitions. Second operand has 12 states, 12 states have (on average 17.916666666666668) internal successors, (215), 11 states have internal predecessors, (215), 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:01:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:50,862 INFO L93 Difference]: Finished difference Result 151696 states and 202043 transitions. [2024-11-10 00:01:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 17.916666666666668) internal successors, (215), 11 states have internal predecessors, (215), 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 215 [2024-11-10 00:01:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:51,016 INFO L225 Difference]: With dead ends: 151696 [2024-11-10 00:01:51,017 INFO L226 Difference]: Without dead ends: 123270 [2024-11-10 00:01:51,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2024-11-10 00:01:51,054 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1252 mSDsluCounter, 2030 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:51,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 2392 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:01:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123270 states. [2024-11-10 00:01:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123270 to 59384. [2024-11-10 00:01:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59384 states, 59383 states have (on average 1.3263391879830928) internal successors, (78762), 59383 states have internal predecessors, (78762), 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:01:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59384 states to 59384 states and 78762 transitions. [2024-11-10 00:01:52,534 INFO L78 Accepts]: Start accepts. Automaton has 59384 states and 78762 transitions. Word has length 215 [2024-11-10 00:01:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:52,535 INFO L471 AbstractCegarLoop]: Abstraction has 59384 states and 78762 transitions. [2024-11-10 00:01:52,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.916666666666668) internal successors, (215), 11 states have internal predecessors, (215), 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:01:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 59384 states and 78762 transitions. [2024-11-10 00:01:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 00:01:52,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:52,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:52,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 00:01:52,571 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash 736532812, now seen corresponding path program 1 times [2024-11-10 00:01:52,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:52,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189986590] [2024-11-10 00:01:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:52,958 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:01:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189986590] [2024-11-10 00:01:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189986590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355306871] [2024-11-10 00:01:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:52,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:52,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:52,961 INFO L87 Difference]: Start difference. First operand 59384 states and 78762 transitions. Second operand has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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:01:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:54,125 INFO L93 Difference]: Finished difference Result 149354 states and 197951 transitions. [2024-11-10 00:01:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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 215 [2024-11-10 00:01:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:54,230 INFO L225 Difference]: With dead ends: 149354 [2024-11-10 00:01:54,231 INFO L226 Difference]: Without dead ends: 94991 [2024-11-10 00:01:54,279 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:01:54,280 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1840 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:54,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 1207 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:01:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94991 states. [2024-11-10 00:01:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94991 to 60044. [2024-11-10 00:01:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60044 states, 60043 states have (on average 1.325516713022334) internal successors, (79588), 60043 states have internal predecessors, (79588), 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:01:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60044 states to 60044 states and 79588 transitions. [2024-11-10 00:01:55,484 INFO L78 Accepts]: Start accepts. Automaton has 60044 states and 79588 transitions. Word has length 215 [2024-11-10 00:01:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:55,485 INFO L471 AbstractCegarLoop]: Abstraction has 60044 states and 79588 transitions. [2024-11-10 00:01:55,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 9 states have internal predecessors, (215), 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:01:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60044 states and 79588 transitions. [2024-11-10 00:01:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 00:01:55,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:55,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 00:01:55,518 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -656835357, now seen corresponding path program 1 times [2024-11-10 00:01:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504869979] [2024-11-10 00:01:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:55,587 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:01:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504869979] [2024-11-10 00:01:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504869979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:01:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205670067] [2024-11-10 00:01:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:55,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:01:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:01:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:01:55,590 INFO L87 Difference]: Start difference. First operand 60044 states and 79588 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:01:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:55,899 INFO L93 Difference]: Finished difference Result 118756 states and 157600 transitions. [2024-11-10 00:01:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:01:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2024-11-10 00:01:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:55,962 INFO L225 Difference]: With dead ends: 118756 [2024-11-10 00:01:55,963 INFO L226 Difference]: Without dead ends: 59282 [2024-11-10 00:01:56,005 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:01:56,005 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 252 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:56,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 364 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:01:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59282 states. [2024-11-10 00:01:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59282 to 59282. [2024-11-10 00:01:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59282 states, 59281 states have (on average 1.3225822776268956) internal successors, (78404), 59281 states have internal predecessors, (78404), 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:01:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59282 states to 59282 states and 78404 transitions. [2024-11-10 00:01:57,028 INFO L78 Accepts]: Start accepts. Automaton has 59282 states and 78404 transitions. Word has length 216 [2024-11-10 00:01:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:01:57,029 INFO L471 AbstractCegarLoop]: Abstraction has 59282 states and 78404 transitions. [2024-11-10 00:01:57,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:01:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 59282 states and 78404 transitions. [2024-11-10 00:01:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 00:01:57,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:01:57,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:01:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 00:01:57,065 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:01:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:01:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash 549194990, now seen corresponding path program 1 times [2024-11-10 00:01:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:01:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554416830] [2024-11-10 00:01:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:01:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:01:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:01:57,434 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:01:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:01:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554416830] [2024-11-10 00:01:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554416830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:01:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:01:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:01:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660890838] [2024-11-10 00:01:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:01:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 00:01:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:01:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 00:01:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:01:57,437 INFO L87 Difference]: Start difference. First operand 59282 states and 78404 transitions. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 9 states have internal predecessors, (216), 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:01:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:01:58,527 INFO L93 Difference]: Finished difference Result 109292 states and 144732 transitions. [2024-11-10 00:01:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:01:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 9 states have internal predecessors, (216), 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 216 [2024-11-10 00:01:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:01:58,603 INFO L225 Difference]: With dead ends: 109292 [2024-11-10 00:01:58,603 INFO L226 Difference]: Without dead ends: 60172 [2024-11-10 00:01:58,644 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:01:58,644 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1176 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:01:58,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1201 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:01:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60172 states.