./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/rekh_ctm.3-2.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 a6fb157ae499b257dadbdfdc38e5d4454494023bad31f4939a5eb0b429ddb260 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:59:21,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:59:21,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:59:21,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:59:21,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:59:21,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:59:21,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:59:21,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:59:21,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:59:21,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:59:21,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:59:21,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:59:21,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:59:21,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:59:21,462 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:59:21,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:59:21,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:59:21,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:59:21,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:21,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:59:21,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:59:21,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:59:21,466 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> a6fb157ae499b257dadbdfdc38e5d4454494023bad31f4939a5eb0b429ddb260 [2025-03-03 14:59:21,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:59:21,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:59:21,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:59:21,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:59:21,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:59:21,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.c [2025-03-03 14:59:22,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85bbaf8bc/ef763a94fd474d7db49f4cb0125ba4f1/FLAGd33e684e4 [2025-03-03 14:59:23,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:59:23,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.c [2025-03-03 14:59:23,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85bbaf8bc/ef763a94fd474d7db49f4cb0125ba4f1/FLAGd33e684e4 [2025-03-03 14:59:23,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85bbaf8bc/ef763a94fd474d7db49f4cb0125ba4f1 [2025-03-03 14:59:23,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:59:23,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:59:23,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:23,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:59:23,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:59:23,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:23" (1/1) ... [2025-03-03 14:59:23,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a8923b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:23, skipping insertion in model container [2025-03-03 14:59:23,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:23" (1/1) ... [2025-03-03 14:59:23,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:59:23,549 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/rekh_ctm.3-2.c[1871,1884] [2025-03-03 14:59:23,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:23,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:59:23,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.bug3.i","-S") [42] [2025-03-03 14:59:23,991 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/rekh_ctm.3-2.c[1871,1884] [2025-03-03 14:59:24,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:24,233 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:59:24,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24 WrapperNode [2025-03-03 14:59:24,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:24,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:24,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:59:24,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:59:24,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,544 INFO L138 Inliner]: procedures = 99, calls = 2816, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8627 [2025-03-03 14:59:24,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:24,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:59:24,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:59:24,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:59:24,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,671 INFO L175 MemorySlicer]: Split 2420 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 446 writes are split as follows [0, 7, 7, 7, 7, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6]. [2025-03-03 14:59:24,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:59:24,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:59:24,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:59:24,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:59:24,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (1/1) ... [2025-03-03 14:59:24,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:24,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:24,909 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) [2025-03-03 14:59:24,915 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 [2025-03-03 14:59:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-03-03 14:59:24,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-03-03 14:59:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:59:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 14:59:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 14:59:24,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-03 14:59:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-03-03 14:59:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:24,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 14:59:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-03 14:59:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-03-03 14:59:24,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-03-03 14:59:24,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-03-03 14:59:24,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-03-03 14:59:24,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:59:24,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-03-03 14:59:24,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-03-03 14:59:24,941 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-03-03 14:59:24,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-03-03 14:59:24,942 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-03-03 14:59:24,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:24,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:59:24,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-03 14:59:24,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-03 14:59:24,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:24,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:59:24,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:59:25,380 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:59:25,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:59:34,250 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-03-03 14:59:34,250 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:59:34,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:59:34,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:59:34,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:34 BoogieIcfgContainer [2025-03-03 14:59:34,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:59:34,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:59:34,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:59:34,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:59:34,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:59:23" (1/3) ... [2025-03-03 14:59:34,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ab0043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:34, skipping insertion in model container [2025-03-03 14:59:34,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:24" (2/3) ... [2025-03-03 14:59:34,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ab0043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:34, skipping insertion in model container [2025-03-03 14:59:34,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:34" (3/3) ... [2025-03-03 14:59:34,314 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.3-2.c [2025-03-03 14:59:34,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:59:34,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.3-2.c that has 45 procedures, 2465 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:59:34,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:59:34,431 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;@5094dea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:59:34,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:59:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) [2025-03-03 14:59:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:59:34,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:34,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:34,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:34,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash -743057840, now seen corresponding path program 1 times [2025-03-03 14:59:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973354992] [2025-03-03 14:59:34,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:35,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:59:35,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:59:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:59:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973354992] [2025-03-03 14:59:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973354992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:35,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:59:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360638973] [2025-03-03 14:59:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:59:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:35,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:59:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:35,548 INFO L87 Difference]: Start difference. First operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:59:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:35,779 INFO L93 Difference]: Finished difference Result 4921 states and 7728 transitions. [2025-03-03 14:59:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:59:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-03-03 14:59:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:35,812 INFO L225 Difference]: With dead ends: 4921 [2025-03-03 14:59:35,813 INFO L226 Difference]: Without dead ends: 2452 [2025-03-03 14:59:35,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:35,847 INFO L435 NwaCegarLoop]: 3044 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:35,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:59:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-03 14:59:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2025-03-03 14:59:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2101 states have (on average 1.153736316039981) internal successors, (2424), 2125 states have internal predecessors, (2424), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-03-03 14:59:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3035 transitions. [2025-03-03 14:59:35,984 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3035 transitions. Word has length 148 [2025-03-03 14:59:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:35,984 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3035 transitions. [2025-03-03 14:59:35,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:59:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3035 transitions. [2025-03-03 14:59:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:35,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:35,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:35,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:59:35,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:35,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1532724394, now seen corresponding path program 1 times [2025-03-03 14:59:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832278379] [2025-03-03 14:59:35,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:36,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:36,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:36,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832278379] [2025-03-03 14:59:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832278379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640957397] [2025-03-03 14:59:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:37,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:37,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:37,638 INFO L87 Difference]: Start difference. First operand 2452 states and 3035 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:40,720 INFO L93 Difference]: Finished difference Result 5558 states and 6981 transitions. [2025-03-03 14:59:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-03-03 14:59:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:40,736 INFO L225 Difference]: With dead ends: 5558 [2025-03-03 14:59:40,737 INFO L226 Difference]: Without dead ends: 3111 [2025-03-03 14:59:40,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:40,755 INFO L435 NwaCegarLoop]: 3649 mSDtfsCounter, 3885 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3885 SdHoareTripleChecker+Valid, 9241 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:40,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3885 Valid, 9241 Invalid, 2561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 14:59:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-03 14:59:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2975. [2025-03-03 14:59:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2476 states have (on average 1.1865912762520194) internal successors, (2938), 2506 states have internal predecessors, (2938), 421 states have call successors, (421), 77 states have call predecessors, (421), 77 states have return successors, (420), 406 states have call predecessors, (420), 420 states have call successors, (420) [2025-03-03 14:59:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3779 transitions. [2025-03-03 14:59:40,882 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3779 transitions. Word has length 208 [2025-03-03 14:59:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 3779 transitions. [2025-03-03 14:59:40,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3779 transitions. [2025-03-03 14:59:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:40,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:40,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:59:40,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -7794052, now seen corresponding path program 1 times [2025-03-03 14:59:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629746186] [2025-03-03 14:59:40,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:41,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:41,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:41,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:41,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:59:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629746186] [2025-03-03 14:59:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629746186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:42,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:42,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:42,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026500589] [2025-03-03 14:59:42,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:42,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:42,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:42,013 INFO L87 Difference]: Start difference. First operand 2975 states and 3779 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:44,455 INFO L93 Difference]: Finished difference Result 6457 states and 8262 transitions. [2025-03-03 14:59:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-03-03 14:59:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:44,475 INFO L225 Difference]: With dead ends: 6457 [2025-03-03 14:59:44,475 INFO L226 Difference]: Without dead ends: 3487 [2025-03-03 14:59:44,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:44,493 INFO L435 NwaCegarLoop]: 3526 mSDtfsCounter, 3728 mSDsluCounter, 5461 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3728 SdHoareTripleChecker+Valid, 8987 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:44,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3728 Valid, 8987 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:59:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-03-03 14:59:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3349. [2025-03-03 14:59:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 2752 states have (on average 1.206031976744186) internal successors, (3319), 2791 states have internal predecessors, (3319), 498 states have call successors, (498), 98 states have call predecessors, (498), 98 states have return successors, (497), 479 states have call predecessors, (497), 497 states have call successors, (497) [2025-03-03 14:59:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4314 transitions. [2025-03-03 14:59:44,637 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4314 transitions. Word has length 209 [2025-03-03 14:59:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:44,638 INFO L471 AbstractCegarLoop]: Abstraction has 3349 states and 4314 transitions. [2025-03-03 14:59:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4314 transitions. [2025-03-03 14:59:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 14:59:44,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:44,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:59:44,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1414813080, now seen corresponding path program 1 times [2025-03-03 14:59:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237417037] [2025-03-03 14:59:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:44,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 14:59:45,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 14:59:45,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:59:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237417037] [2025-03-03 14:59:46,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237417037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:46,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:59:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256995321] [2025-03-03 14:59:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:46,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:46,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:46,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:59:46,405 INFO L87 Difference]: Start difference. First operand 3349 states and 4314 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:59:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:48,632 INFO L93 Difference]: Finished difference Result 7067 states and 9166 transitions. [2025-03-03 14:59:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-03-03 14:59:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:48,689 INFO L225 Difference]: With dead ends: 7067 [2025-03-03 14:59:48,689 INFO L226 Difference]: Without dead ends: 3723 [2025-03-03 14:59:48,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:48,700 INFO L435 NwaCegarLoop]: 3420 mSDtfsCounter, 5685 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5685 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:48,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5685 Valid, 6025 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:59:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2025-03-03 14:59:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2025-03-03 14:59:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3027 states have (on average 1.222001982160555) internal successors, (3699), 3072 states have internal predecessors, (3699), 575 states have call successors, (575), 118 states have call predecessors, (575), 118 states have return successors, (574), 554 states have call predecessors, (574), 574 states have call successors, (574) [2025-03-03 14:59:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4848 transitions. [2025-03-03 14:59:48,808 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4848 transitions. Word has length 205 [2025-03-03 14:59:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:48,808 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 4848 transitions. [2025-03-03 14:59:48,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:59:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4848 transitions. [2025-03-03 14:59:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:48,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:48,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:48,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:59:48,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:48,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 972951326, now seen corresponding path program 1 times [2025-03-03 14:59:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862808717] [2025-03-03 14:59:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:49,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:49,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:49,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:59:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862808717] [2025-03-03 14:59:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862808717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737415216] [2025-03-03 14:59:49,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:49,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:49,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:49,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:49,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:59:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:50,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:50,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:59:50,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:59:50,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737415216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006424295] [2025-03-03 14:59:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:50,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:50,956 INFO L87 Difference]: Start difference. First operand 3721 states and 4848 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:52,376 INFO L93 Difference]: Finished difference Result 7674 states and 9983 transitions. [2025-03-03 14:59:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-03-03 14:59:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:52,397 INFO L225 Difference]: With dead ends: 7674 [2025-03-03 14:59:52,397 INFO L226 Difference]: Without dead ends: 3844 [2025-03-03 14:59:52,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:52,413 INFO L435 NwaCegarLoop]: 3598 mSDtfsCounter, 1465 mSDsluCounter, 6334 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9932 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:52,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9932 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:59:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-03-03 14:59:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3708. [2025-03-03 14:59:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3019 states have (on average 1.2206028486253726) internal successors, (3685), 3064 states have internal predecessors, (3685), 570 states have call successors, (570), 118 states have call predecessors, (570), 118 states have return successors, (569), 549 states have call predecessors, (569), 569 states have call successors, (569) [2025-03-03 14:59:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 4824 transitions. [2025-03-03 14:59:52,590 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 4824 transitions. Word has length 208 [2025-03-03 14:59:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:52,591 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 4824 transitions. [2025-03-03 14:59:52,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4824 transitions. [2025-03-03 14:59:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:52,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:52,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:52,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:59:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:52,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash -292046140, now seen corresponding path program 1 times [2025-03-03 14:59:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467375026] [2025-03-03 14:59:52,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:53,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:53,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:53,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:59:53,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:53,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467375026] [2025-03-03 14:59:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467375026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187698313] [2025-03-03 14:59:53,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:53,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:53,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:53,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:59:54,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:54,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:54,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:59:54,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187698313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071637994] [2025-03-03 14:59:54,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:54,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:54,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:54,785 INFO L87 Difference]: Start difference. First operand 3708 states and 4824 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:55,821 INFO L93 Difference]: Finished difference Result 7605 states and 9878 transitions. [2025-03-03 14:59:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-03-03 14:59:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:55,839 INFO L225 Difference]: With dead ends: 7605 [2025-03-03 14:59:55,839 INFO L226 Difference]: Without dead ends: 3836 [2025-03-03 14:59:55,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:55,853 INFO L435 NwaCegarLoop]: 3576 mSDtfsCounter, 1176 mSDsluCounter, 8739 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 12315 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:55,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 12315 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:59:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2025-03-03 14:59:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 3698. [2025-03-03 14:59:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3013 states have (on average 1.2193826750746763) internal successors, (3674), 3058 states have internal predecessors, (3674), 566 states have call successors, (566), 118 states have call predecessors, (566), 118 states have return successors, (565), 545 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-03 14:59:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4805 transitions. [2025-03-03 14:59:55,998 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4805 transitions. Word has length 209 [2025-03-03 14:59:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:55,999 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 4805 transitions. [2025-03-03 14:59:55,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4805 transitions. [2025-03-03 14:59:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:56,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:56,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:59:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 14:59:56,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:56,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -603552259, now seen corresponding path program 1 times [2025-03-03 14:59:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806543836] [2025-03-03 14:59:56,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:56,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:56,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:56,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:56,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:59:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806543836] [2025-03-03 14:59:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806543836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366360873] [2025-03-03 14:59:56,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:56,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:59:56,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:59:57,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:58,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:59:58,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366360873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:58,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981228067] [2025-03-03 14:59:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:58,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:58,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:58,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:58,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:58,152 INFO L87 Difference]: Start difference. First operand 3698 states and 4805 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:59,392 INFO L93 Difference]: Finished difference Result 8208 states and 10668 transitions. [2025-03-03 14:59:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-03-03 14:59:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:59,413 INFO L225 Difference]: With dead ends: 8208 [2025-03-03 14:59:59,414 INFO L226 Difference]: Without dead ends: 4515 [2025-03-03 14:59:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:59:59,426 INFO L435 NwaCegarLoop]: 3943 mSDtfsCounter, 1741 mSDsluCounter, 7031 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 10974 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:59,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 10974 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:59:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2025-03-03 14:59:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4186. [2025-03-03 14:59:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.236115236115236) internal successors, (4162), 3423 states have internal predecessors, (4162), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-03-03 14:59:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5514 transitions. [2025-03-03 14:59:59,555 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5514 transitions. Word has length 210 [2025-03-03 14:59:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:59,555 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5514 transitions. [2025-03-03 14:59:59,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:59:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5514 transitions. [2025-03-03 14:59:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:59,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:59,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:59:59,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:59,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 916495161, now seen corresponding path program 1 times [2025-03-03 14:59:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184625106] [2025-03-03 14:59:59,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:59,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:00,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 15:00:00,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 15:00:00,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:00:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:00,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184625106] [2025-03-03 15:00:00,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184625106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:00,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265151638] [2025-03-03 15:00:00,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:00,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:00,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:00,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:00,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:00:01,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 15:00:01,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 15:00:01,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:01,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:01,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 15:00:01,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 15:00:01,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:00:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265151638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:00:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 15:00:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492419260] [2025-03-03 15:00:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:01,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:01,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:01,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:01,764 INFO L87 Difference]: Start difference. First operand 4186 states and 5514 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:00:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:02,737 INFO L93 Difference]: Finished difference Result 8369 states and 11032 transitions. [2025-03-03 15:00:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-03-03 15:00:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:02,765 INFO L225 Difference]: With dead ends: 8369 [2025-03-03 15:00:02,765 INFO L226 Difference]: Without dead ends: 4188 [2025-03-03 15:00:02,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:00:02,779 INFO L435 NwaCegarLoop]: 2943 mSDtfsCounter, 1062 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 8692 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:02,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 8692 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:00:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-03-03 15:00:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4186. [2025-03-03 15:00:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.235818235818236) internal successors, (4161), 3423 states have internal predecessors, (4161), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-03-03 15:00:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5513 transitions. [2025-03-03 15:00:02,913 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5513 transitions. Word has length 210 [2025-03-03 15:00:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:02,913 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5513 transitions. [2025-03-03 15:00:02,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:00:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5513 transitions. [2025-03-03 15:00:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 15:00:02,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:02,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:02,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:00:03,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:03,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:03,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1278122663, now seen corresponding path program 1 times [2025-03-03 15:00:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364007698] [2025-03-03 15:00:03,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:03,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 15:00:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 15:00:03,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:03,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 15:00:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364007698] [2025-03-03 15:00:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364007698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800459199] [2025-03-03 15:00:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:03,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:03,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:03,952 INFO L87 Difference]: Start difference. First operand 4186 states and 5513 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:05,475 INFO L93 Difference]: Finished difference Result 7873 states and 10305 transitions. [2025-03-03 15:00:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 15:00:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:05,495 INFO L225 Difference]: With dead ends: 7873 [2025-03-03 15:00:05,495 INFO L226 Difference]: Without dead ends: 3692 [2025-03-03 15:00:05,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:05,509 INFO L435 NwaCegarLoop]: 3490 mSDtfsCounter, 6660 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6660 SdHoareTripleChecker+Valid, 6135 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 849 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:05,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6660 Valid, 6135 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [849 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:00:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-03-03 15:00:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3690. [2025-03-03 15:00:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3008 states have (on average 1.217752659574468) internal successors, (3663), 3053 states have internal predecessors, (3663), 563 states have call successors, (563), 118 states have call predecessors, (563), 118 states have return successors, (562), 542 states have call predecessors, (562), 562 states have call successors, (562) [2025-03-03 15:00:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4788 transitions. [2025-03-03 15:00:05,613 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4788 transitions. Word has length 220 [2025-03-03 15:00:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:05,614 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4788 transitions. [2025-03-03 15:00:05,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4788 transitions. [2025-03-03 15:00:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 15:00:05,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:05,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:05,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:00:05,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:05,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1104207979, now seen corresponding path program 1 times [2025-03-03 15:00:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985060619] [2025-03-03 15:00:05,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:05,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 15:00:05,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 15:00:05,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:05,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:00:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985060619] [2025-03-03 15:00:06,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985060619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:00:06,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641666636] [2025-03-03 15:00:06,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:06,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:00:06,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:00:06,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:00:06,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:00:07,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 15:00:07,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 15:00:07,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:07,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:07,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 15:00:07,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:00:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:00:07,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:00:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641666636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:07,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:00:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 15:00:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112114037] [2025-03-03 15:00:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:07,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:07,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:07,612 INFO L87 Difference]: Start difference. First operand 3690 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:08,925 INFO L93 Difference]: Finished difference Result 7375 states and 9577 transitions. [2025-03-03 15:00:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:08,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 15:00:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:08,941 INFO L225 Difference]: With dead ends: 7375 [2025-03-03 15:00:08,942 INFO L226 Difference]: Without dead ends: 3690 [2025-03-03 15:00:08,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:08,955 INFO L435 NwaCegarLoop]: 3060 mSDtfsCounter, 4522 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 5997 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:08,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 5997 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:00:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-03 15:00:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-03 15:00:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-03-03 15:00:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4784 transitions. [2025-03-03 15:00:09,086 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4784 transitions. Word has length 220 [2025-03-03 15:00:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:09,087 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4784 transitions. [2025-03-03 15:00:09,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4784 transitions. [2025-03-03 15:00:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 15:00:09,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:09,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:09,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:00:09,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 15:00:09,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:09,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 900710429, now seen corresponding path program 1 times [2025-03-03 15:00:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:09,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007877880] [2025-03-03 15:00:09,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:09,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 15:00:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 15:00:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 15:00:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007877880] [2025-03-03 15:00:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007877880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72811354] [2025-03-03 15:00:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:09,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:09,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:09,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:09,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:09,908 INFO L87 Difference]: Start difference. First operand 3688 states and 4784 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:11,691 INFO L93 Difference]: Finished difference Result 7373 states and 9571 transitions. [2025-03-03 15:00:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:11,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-03-03 15:00:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:11,712 INFO L225 Difference]: With dead ends: 7373 [2025-03-03 15:00:11,712 INFO L226 Difference]: Without dead ends: 3690 [2025-03-03 15:00:11,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:11,731 INFO L435 NwaCegarLoop]: 3392 mSDtfsCounter, 3626 mSDsluCounter, 5178 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 8570 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 8570 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:00:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-03 15:00:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-03 15:00:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.217159960093116) internal successors, (3660), 3052 states have internal predecessors, (3660), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-03-03 15:00:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4783 transitions. [2025-03-03 15:00:11,859 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4783 transitions. Word has length 220 [2025-03-03 15:00:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:11,860 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4783 transitions. [2025-03-03 15:00:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:00:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4783 transitions. [2025-03-03 15:00:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 15:00:11,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:11,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:00:11,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1019062079, now seen corresponding path program 1 times [2025-03-03 15:00:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764487017] [2025-03-03 15:00:11,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:12,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 15:00:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 15:00:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 15:00:12,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764487017] [2025-03-03 15:00:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764487017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798061099] [2025-03-03 15:00:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:12,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:12,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:12,514 INFO L87 Difference]: Start difference. First operand 3688 states and 4783 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:14,353 INFO L93 Difference]: Finished difference Result 7505 states and 9717 transitions. [2025-03-03 15:00:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 223 [2025-03-03 15:00:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:14,375 INFO L225 Difference]: With dead ends: 7505 [2025-03-03 15:00:14,375 INFO L226 Difference]: Without dead ends: 3822 [2025-03-03 15:00:14,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:14,389 INFO L435 NwaCegarLoop]: 3625 mSDtfsCounter, 3877 mSDsluCounter, 5565 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 9190 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:14,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3877 Valid, 9190 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:00:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2025-03-03 15:00:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3686. [2025-03-03 15:00:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3006 states have (on average 1.2168995342648037) internal successors, (3658), 3051 states have internal predecessors, (3658), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-03-03 15:00:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4779 transitions. [2025-03-03 15:00:14,494 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4779 transitions. Word has length 223 [2025-03-03 15:00:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:14,494 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4779 transitions. [2025-03-03 15:00:14,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4779 transitions. [2025-03-03 15:00:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 15:00:14,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:14,497 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:14,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:00:14,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 922640830, now seen corresponding path program 1 times [2025-03-03 15:00:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700720681] [2025-03-03 15:00:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:14,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 15:00:14,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 15:00:14,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:14,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 15:00:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:15,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700720681] [2025-03-03 15:00:15,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700720681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:15,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:15,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363207040] [2025-03-03 15:00:15,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:15,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:15,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:15,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:15,178 INFO L87 Difference]: Start difference. First operand 3686 states and 4779 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:16,881 INFO L93 Difference]: Finished difference Result 7501 states and 9709 transitions. [2025-03-03 15:00:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 224 [2025-03-03 15:00:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:16,897 INFO L225 Difference]: With dead ends: 7501 [2025-03-03 15:00:16,897 INFO L226 Difference]: Without dead ends: 3820 [2025-03-03 15:00:16,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:16,911 INFO L435 NwaCegarLoop]: 3503 mSDtfsCounter, 6683 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6683 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:16,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6683 Valid, 6218 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:00:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-03-03 15:00:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3682. [2025-03-03 15:00:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3004 states have (on average 1.2163781624500665) internal successors, (3654), 3049 states have internal predecessors, (3654), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558) [2025-03-03 15:00:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4771 transitions. [2025-03-03 15:00:17,021 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4771 transitions. Word has length 224 [2025-03-03 15:00:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4771 transitions. [2025-03-03 15:00:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4771 transitions. [2025-03-03 15:00:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 15:00:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:17,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:00:17,024 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:17,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1252649154, now seen corresponding path program 1 times [2025-03-03 15:00:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:17,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107630812] [2025-03-03 15:00:17,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 15:00:17,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 15:00:17,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:17,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 15:00:17,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:17,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107630812] [2025-03-03 15:00:17,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107630812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781144442] [2025-03-03 15:00:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:17,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:17,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:17,680 INFO L87 Difference]: Start difference. First operand 3682 states and 4771 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:19,443 INFO L93 Difference]: Finished difference Result 7357 states and 9541 transitions. [2025-03-03 15:00:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 225 [2025-03-03 15:00:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:19,458 INFO L225 Difference]: With dead ends: 7357 [2025-03-03 15:00:19,458 INFO L226 Difference]: Without dead ends: 3680 [2025-03-03 15:00:19,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:19,470 INFO L435 NwaCegarLoop]: 3477 mSDtfsCounter, 5728 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5728 SdHoareTripleChecker+Valid, 7950 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:19,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5728 Valid, 7950 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:00:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-03-03 15:00:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-03-03 15:00:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.2158560959360427) internal successors, (3650), 3047 states have internal predecessors, (3650), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-03 15:00:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4763 transitions. [2025-03-03 15:00:19,564 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4763 transitions. Word has length 225 [2025-03-03 15:00:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:19,565 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4763 transitions. [2025-03-03 15:00:19,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 15:00:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4763 transitions. [2025-03-03 15:00:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 15:00:19,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:19,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:19,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:00:19,567 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:19,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:19,568 INFO L85 PathProgramCache]: Analyzing trace with hash 649721093, now seen corresponding path program 1 times [2025-03-03 15:00:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:19,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950933093] [2025-03-03 15:00:19,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:19,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 15:00:19,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 15:00:19,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:19,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950933093] [2025-03-03 15:00:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950933093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762233200] [2025-03-03 15:00:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:20,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:20,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:20,226 INFO L87 Difference]: Start difference. First operand 3678 states and 4763 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:00:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:21,729 INFO L93 Difference]: Finished difference Result 7353 states and 9529 transitions. [2025-03-03 15:00:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:21,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225 [2025-03-03 15:00:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:21,745 INFO L225 Difference]: With dead ends: 7353 [2025-03-03 15:00:21,745 INFO L226 Difference]: Without dead ends: 3680 [2025-03-03 15:00:21,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:00:21,762 INFO L435 NwaCegarLoop]: 3371 mSDtfsCounter, 6425 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6425 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:21,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6425 Valid, 5945 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:00:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-03-03 15:00:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-03-03 15:00:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.215522984676882) internal successors, (3649), 3047 states have internal predecessors, (3649), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-03 15:00:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4762 transitions. [2025-03-03 15:00:21,885 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4762 transitions. Word has length 225 [2025-03-03 15:00:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:21,886 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4762 transitions. [2025-03-03 15:00:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:00:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4762 transitions. [2025-03-03 15:00:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 15:00:21,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:21,888 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:00:21,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1765688453, now seen corresponding path program 1 times [2025-03-03 15:00:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264902089] [2025-03-03 15:00:21,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:22,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 15:00:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 15:00:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264902089] [2025-03-03 15:00:22,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264902089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:22,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45078551] [2025-03-03 15:00:22,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:22,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:22,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:22,593 INFO L87 Difference]: Start difference. First operand 3678 states and 4762 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:24,319 INFO L93 Difference]: Finished difference Result 7485 states and 9675 transitions. [2025-03-03 15:00:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 228 [2025-03-03 15:00:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:24,335 INFO L225 Difference]: With dead ends: 7485 [2025-03-03 15:00:24,336 INFO L226 Difference]: Without dead ends: 3812 [2025-03-03 15:00:24,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:24,348 INFO L435 NwaCegarLoop]: 3604 mSDtfsCounter, 5789 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5789 SdHoareTripleChecker+Valid, 8166 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:24,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5789 Valid, 8166 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:00:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2025-03-03 15:00:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3676. [2025-03-03 15:00:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 3001 states have (on average 1.2152615794735089) internal successors, (3647), 3046 states have internal predecessors, (3647), 556 states have call successors, (556), 118 states have call predecessors, (556), 118 states have return successors, (555), 535 states have call predecessors, (555), 555 states have call successors, (555) [2025-03-03 15:00:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4758 transitions. [2025-03-03 15:00:24,443 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4758 transitions. Word has length 228 [2025-03-03 15:00:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4758 transitions. [2025-03-03 15:00:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4758 transitions. [2025-03-03 15:00:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 15:00:24,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:24,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:00:24,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1737631225, now seen corresponding path program 1 times [2025-03-03 15:00:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595972142] [2025-03-03 15:00:24,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:24,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 15:00:24,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 15:00:24,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:24,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595972142] [2025-03-03 15:00:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595972142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042754076] [2025-03-03 15:00:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:25,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:25,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:25,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:25,066 INFO L87 Difference]: Start difference. First operand 3676 states and 4758 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:26,421 INFO L93 Difference]: Finished difference Result 7481 states and 9667 transitions. [2025-03-03 15:00:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229 [2025-03-03 15:00:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:26,435 INFO L225 Difference]: With dead ends: 7481 [2025-03-03 15:00:26,436 INFO L226 Difference]: Without dead ends: 3810 [2025-03-03 15:00:26,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:26,447 INFO L435 NwaCegarLoop]: 3495 mSDtfsCounter, 4667 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 7080 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:26,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 7080 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:00:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2025-03-03 15:00:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3672. [2025-03-03 15:00:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2999 states have (on average 1.2147382460820273) internal successors, (3643), 3044 states have internal predecessors, (3643), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-03-03 15:00:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4750 transitions. [2025-03-03 15:00:26,545 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4750 transitions. Word has length 229 [2025-03-03 15:00:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:26,545 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 4750 transitions. [2025-03-03 15:00:26,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4750 transitions. [2025-03-03 15:00:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:26,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:26,547 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:00:26,548 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1506553926, now seen corresponding path program 1 times [2025-03-03 15:00:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679553637] [2025-03-03 15:00:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:26,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:26,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:26,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:26,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 15:00:27,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:27,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679553637] [2025-03-03 15:00:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679553637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:27,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469407590] [2025-03-03 15:00:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:27,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:27,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:27,163 INFO L87 Difference]: Start difference. First operand 3672 states and 4750 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:28,610 INFO L93 Difference]: Finished difference Result 7337 states and 9499 transitions. [2025-03-03 15:00:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 230 [2025-03-03 15:00:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:28,624 INFO L225 Difference]: With dead ends: 7337 [2025-03-03 15:00:28,625 INFO L226 Difference]: Without dead ends: 3670 [2025-03-03 15:00:28,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:00:28,672 INFO L435 NwaCegarLoop]: 3469 mSDtfsCounter, 6624 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6624 SdHoareTripleChecker+Valid, 6102 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:28,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6624 Valid, 6102 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:00:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-03-03 15:00:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-03-03 15:00:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2142142142142143) internal successors, (3639), 3042 states have internal predecessors, (3639), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-03 15:00:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4742 transitions. [2025-03-03 15:00:28,763 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4742 transitions. Word has length 230 [2025-03-03 15:00:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:28,763 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4742 transitions. [2025-03-03 15:00:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 15:00:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4742 transitions. [2025-03-03 15:00:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:28,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:28,765 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:28,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:00:28,766 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:28,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1006211798, now seen corresponding path program 1 times [2025-03-03 15:00:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786170280] [2025-03-03 15:00:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:29,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:29,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786170280] [2025-03-03 15:00:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786170280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:29,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698112629] [2025-03-03 15:00:29,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:29,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:29,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:29,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:29,349 INFO L87 Difference]: Start difference. First operand 3668 states and 4742 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:00:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:29,901 INFO L93 Difference]: Finished difference Result 7333 states and 9486 transitions. [2025-03-03 15:00:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 230 [2025-03-03 15:00:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:29,918 INFO L225 Difference]: With dead ends: 7333 [2025-03-03 15:00:29,918 INFO L226 Difference]: Without dead ends: 3670 [2025-03-03 15:00:29,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:29,935 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 1022 mSDsluCounter, 7695 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:29,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 10622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-03-03 15:00:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-03-03 15:00:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2138805472138805) internal successors, (3638), 3042 states have internal predecessors, (3638), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-03 15:00:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4741 transitions. [2025-03-03 15:00:30,092 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4741 transitions. Word has length 230 [2025-03-03 15:00:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:30,092 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4741 transitions. [2025-03-03 15:00:30,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:00:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4741 transitions. [2025-03-03 15:00:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 15:00:30,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:30,096 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:30,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:00:30,096 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 541198440, now seen corresponding path program 1 times [2025-03-03 15:00:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693814703] [2025-03-03 15:00:30,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:30,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 15:00:30,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 15:00:30,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:30,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693814703] [2025-03-03 15:00:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693814703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:30,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:30,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:30,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418482448] [2025-03-03 15:00:30,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:30,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:30,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:30,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:30,628 INFO L87 Difference]: Start difference. First operand 3668 states and 4741 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:31,455 INFO L93 Difference]: Finished difference Result 7465 states and 9632 transitions. [2025-03-03 15:00:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-03-03 15:00:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:31,469 INFO L225 Difference]: With dead ends: 7465 [2025-03-03 15:00:31,469 INFO L226 Difference]: Without dead ends: 3802 [2025-03-03 15:00:31,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:31,480 INFO L435 NwaCegarLoop]: 3007 mSDtfsCounter, 4307 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 7337 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:31,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 7337 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:00:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-03-03 15:00:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3666. [2025-03-03 15:00:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2996 states have (on average 1.213618157543391) internal successors, (3636), 3041 states have internal predecessors, (3636), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-03-03 15:00:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4737 transitions. [2025-03-03 15:00:31,572 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4737 transitions. Word has length 233 [2025-03-03 15:00:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 4737 transitions. [2025-03-03 15:00:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4737 transitions. [2025-03-03 15:00:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 15:00:31,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:31,575 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:00:31,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 728584291, now seen corresponding path program 1 times [2025-03-03 15:00:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623995061] [2025-03-03 15:00:31,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:31,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 15:00:31,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 15:00:31,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623995061] [2025-03-03 15:00:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623995061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:32,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344023737] [2025-03-03 15:00:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:32,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:32,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:32,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:32,180 INFO L87 Difference]: Start difference. First operand 3666 states and 4737 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:33,037 INFO L93 Difference]: Finished difference Result 7463 states and 9625 transitions. [2025-03-03 15:00:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-03-03 15:00:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:33,051 INFO L225 Difference]: With dead ends: 7463 [2025-03-03 15:00:33,051 INFO L226 Difference]: Without dead ends: 3802 [2025-03-03 15:00:33,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:33,063 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 4502 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:33,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 6918 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:00:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-03-03 15:00:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3664. [2025-03-03 15:00:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2995 states have (on average 1.213355592654424) internal successors, (3634), 3040 states have internal predecessors, (3634), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-03-03 15:00:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4733 transitions. [2025-03-03 15:00:33,154 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4733 transitions. Word has length 234 [2025-03-03 15:00:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4733 transitions. [2025-03-03 15:00:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4733 transitions. [2025-03-03 15:00:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:33,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:33,156 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:00:33,156 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -652305719, now seen corresponding path program 1 times [2025-03-03 15:00:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:33,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708174876] [2025-03-03 15:00:33,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:33,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:33,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:33,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:33,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 15:00:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708174876] [2025-03-03 15:00:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708174876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701014724] [2025-03-03 15:00:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:33,720 INFO L87 Difference]: Start difference. First operand 3664 states and 4733 transitions. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:34,222 INFO L93 Difference]: Finished difference Result 7323 states and 9465 transitions. [2025-03-03 15:00:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-03-03 15:00:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:34,237 INFO L225 Difference]: With dead ends: 7323 [2025-03-03 15:00:34,237 INFO L226 Difference]: Without dead ends: 3664 [2025-03-03 15:00:34,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:34,250 INFO L435 NwaCegarLoop]: 3031 mSDtfsCounter, 2493 mSDsluCounter, 5232 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 8263 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:34,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 8263 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-03 15:00:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-03-03 15:00:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2994 states have (on average 1.2130928523714095) internal successors, (3632), 3039 states have internal predecessors, (3632), 549 states have call successors, (549), 118 states have call predecessors, (549), 118 states have return successors, (548), 528 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 15:00:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4729 transitions. [2025-03-03 15:00:34,337 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4729 transitions. Word has length 235 [2025-03-03 15:00:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:34,338 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4729 transitions. [2025-03-03 15:00:34,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4729 transitions. [2025-03-03 15:00:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:34,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:34,339 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:00:34,340 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1843572456, now seen corresponding path program 1 times [2025-03-03 15:00:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612038392] [2025-03-03 15:00:34,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:34,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:34,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:34,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:34,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612038392] [2025-03-03 15:00:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612038392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327952755] [2025-03-03 15:00:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:34,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:34,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:34,920 INFO L87 Difference]: Start difference. First operand 3662 states and 4729 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:35,506 INFO L93 Difference]: Finished difference Result 7321 states and 9460 transitions. [2025-03-03 15:00:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 235 [2025-03-03 15:00:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:35,524 INFO L225 Difference]: With dead ends: 7321 [2025-03-03 15:00:35,524 INFO L226 Difference]: Without dead ends: 3664 [2025-03-03 15:00:35,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:35,541 INFO L435 NwaCegarLoop]: 2914 mSDtfsCounter, 1001 mSDsluCounter, 7681 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 10595 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:35,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 10595 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:00:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-03 15:00:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-03-03 15:00:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2994 states have (on average 1.2127588510354042) internal successors, (3631), 3039 states have internal predecessors, (3631), 549 states have call successors, (549), 118 states have call predecessors, (549), 118 states have return successors, (548), 528 states have call predecessors, (548), 548 states have call successors, (548) [2025-03-03 15:00:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4728 transitions. [2025-03-03 15:00:35,693 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4728 transitions. Word has length 235 [2025-03-03 15:00:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4728 transitions. [2025-03-03 15:00:35,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 15:00:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4728 transitions. [2025-03-03 15:00:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 15:00:35,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:35,696 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:35,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:00:35,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash 758217460, now seen corresponding path program 1 times [2025-03-03 15:00:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583275738] [2025-03-03 15:00:35,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:35,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 15:00:36,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 15:00:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:36,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583275738] [2025-03-03 15:00:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583275738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:36,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:36,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:36,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566306097] [2025-03-03 15:00:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:36,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:36,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:36,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:36,289 INFO L87 Difference]: Start difference. First operand 3662 states and 4728 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:37,056 INFO L93 Difference]: Finished difference Result 7453 states and 9606 transitions. [2025-03-03 15:00:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 238 [2025-03-03 15:00:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:37,071 INFO L225 Difference]: With dead ends: 7453 [2025-03-03 15:00:37,071 INFO L226 Difference]: Without dead ends: 3796 [2025-03-03 15:00:37,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:37,082 INFO L435 NwaCegarLoop]: 2994 mSDtfsCounter, 4272 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 7310 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:37,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 7310 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:00:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2025-03-03 15:00:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3660. [2025-03-03 15:00:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2993 states have (on average 1.212495823588373) internal successors, (3629), 3038 states have internal predecessors, (3629), 548 states have call successors, (548), 118 states have call predecessors, (548), 118 states have return successors, (547), 527 states have call predecessors, (547), 547 states have call successors, (547) [2025-03-03 15:00:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4724 transitions. [2025-03-03 15:00:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4724 transitions. Word has length 238 [2025-03-03 15:00:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:37,217 INFO L471 AbstractCegarLoop]: Abstraction has 3660 states and 4724 transitions. [2025-03-03 15:00:37,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 15:00:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4724 transitions. [2025-03-03 15:00:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-03 15:00:37,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:37,219 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:00:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:00:37,219 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:37,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash -320230930, now seen corresponding path program 1 times [2025-03-03 15:00:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153636283] [2025-03-03 15:00:37,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:37,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-03 15:00:37,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-03 15:00:37,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:37,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 15:00:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:37,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153636283] [2025-03-03 15:00:37,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153636283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:37,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:37,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608669782] [2025-03-03 15:00:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:37,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:37,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:37,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:37,820 INFO L87 Difference]: Start difference. First operand 3660 states and 4724 transitions. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)