./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-1.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-1.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 0c11dfbc24d8e2936a0720b93d6e580e096b076c7149ef4cbc8369f1ef818941 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:59:04,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:59:04,426 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:04,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:59:04,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:59:04,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:59:04,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:59:04,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:59:04,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:59:04,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:59:04,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:59:04,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:59:04,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:59:04,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:59:04,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:59:04,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:59:04,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:59:04,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:04,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:59:04,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:59:04,458 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 -> 0c11dfbc24d8e2936a0720b93d6e580e096b076c7149ef4cbc8369f1ef818941 [2025-03-03 14:59:04,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:59:04,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:59:04,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:59:04,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:59:04,715 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:59:04,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-1.c [2025-03-03 14:59:05,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08591b262/175f19bb9cc14628b3e533c29ef1e063/FLAG370bc7b16 [2025-03-03 14:59:06,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:59:06,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-1.c [2025-03-03 14:59:06,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08591b262/175f19bb9cc14628b3e533c29ef1e063/FLAG370bc7b16 [2025-03-03 14:59:06,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08591b262/175f19bb9cc14628b3e533c29ef1e063 [2025-03-03 14:59:06,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:59:06,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:59:06,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:06,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:59:06,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:59:06,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:06" (1/1) ... [2025-03-03 14:59:06,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a383f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:06, skipping insertion in model container [2025-03-03 14:59:06,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:59:06" (1/1) ... [2025-03-03 14:59:06,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:59:06,689 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-1.c[1870,1883] [2025-03-03 14:59:07,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:07,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:59:07,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok3.i","-S") [42] [2025-03-03 14:59:07,192 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-1.c[1870,1883] [2025-03-03 14:59:07,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:59:07,444 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:59:07,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:07 WrapperNode [2025-03-03 14:59:07,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:59:07,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:07,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:59:07,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:59:07,454 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:07" (1/1) ... [2025-03-03 14:59:07,515 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:07" (1/1) ... [2025-03-03 14:59:07,705 INFO L138 Inliner]: procedures = 99, calls = 2816, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8627 [2025-03-03 14:59:07,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:59:07,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:59:07,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:59:07,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:59:07,714 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:07" (1/1) ... [2025-03-03 14:59:07,715 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:07" (1/1) ... [2025-03-03 14:59:07,761 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:07" (1/1) ... [2025-03-03 14:59:07,873 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:07,874 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:07" (1/1) ... [2025-03-03 14:59:07,874 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:07" (1/1) ... [2025-03-03 14:59:07,996 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:07" (1/1) ... [2025-03-03 14:59:08,013 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:07" (1/1) ... [2025-03-03 14:59:08,040 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:07" (1/1) ... [2025-03-03 14:59:08,061 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:07" (1/1) ... [2025-03-03 14:59:08,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:59:08,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:59:08,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:59:08,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:59:08,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:07" (1/1) ... [2025-03-03 14:59:08,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:59:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:08,199 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:08,206 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:08,224 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-03-03 14:59:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-03-03 14:59:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-03-03 14:59:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-03-03 14:59:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:59:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:59:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:59:08,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 14:59:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-03 14:59:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-03 14:59:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:08,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:59:08,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-03-03 14:59:08,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-03-03 14:59:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:59:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-03-03 14:59:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-03-03 14:59:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-03-03 14:59:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-03-03 14:59:08,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-03-03 14:59:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-03-03 14:59:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:59:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:59:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:59:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:59:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:59:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:59:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-03-03 14:59:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:59:08,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:59:08,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:59:08,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:59:17,820 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-03-03 14:59:17,821 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:59:17,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:59:17,866 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:59:17,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:17 BoogieIcfgContainer [2025-03-03 14:59:17,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:59:17,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:59:17,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:59:17,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:59:17,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:59:06" (1/3) ... [2025-03-03 14:59:17,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831948e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:17, skipping insertion in model container [2025-03-03 14:59:17,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:59:07" (2/3) ... [2025-03-03 14:59:17,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3831948e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:59:17, skipping insertion in model container [2025-03-03 14:59:17,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:59:17" (3/3) ... [2025-03-03 14:59:17,877 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.3-1.c [2025-03-03 14:59:17,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:59:17,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.3-1.c that has 45 procedures, 2465 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:59:17,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:59:17,982 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;@400557f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:59:17,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:59:17,993 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:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:59:18,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:18,009 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:18,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:18,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:18,014 INFO L85 PathProgramCache]: Analyzing trace with hash -743057840, now seen corresponding path program 1 times [2025-03-03 14:59:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869098814] [2025-03-03 14:59:18,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:59:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:59:18,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:18,914 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:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869098814] [2025-03-03 14:59:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869098814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:59:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569778382] [2025-03-03 14:59:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:59:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:18,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:59:18,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:59:18,949 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:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:19,290 INFO L93 Difference]: Finished difference Result 4921 states and 7728 transitions. [2025-03-03 14:59:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:59:19,297 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:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:19,326 INFO L225 Difference]: With dead ends: 4921 [2025-03-03 14:59:19,327 INFO L226 Difference]: Without dead ends: 2452 [2025-03-03 14:59:19,355 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:19,357 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:19,360 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:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-03 14:59:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2025-03-03 14:59:19,485 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:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3035 transitions. [2025-03-03 14:59:19,515 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3035 transitions. Word has length 148 [2025-03-03 14:59:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:19,516 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3035 transitions. [2025-03-03 14:59:19,516 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:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3035 transitions. [2025-03-03 14:59:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:19,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:19,528 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:19,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:59:19,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:19,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1532724394, now seen corresponding path program 1 times [2025-03-03 14:59:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843850857] [2025-03-03 14:59:19,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:19,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:20,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:20,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:21,088 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:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843850857] [2025-03-03 14:59:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843850857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:21,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350304385] [2025-03-03 14:59:21,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:21,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:21,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:21,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:21,092 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:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:24,101 INFO L93 Difference]: Finished difference Result 5558 states and 6981 transitions. [2025-03-03 14:59:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:24,102 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:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:24,121 INFO L225 Difference]: With dead ends: 5558 [2025-03-03 14:59:24,122 INFO L226 Difference]: Without dead ends: 3111 [2025-03-03 14:59:24,138 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:24,140 INFO L435 NwaCegarLoop]: 3649 mSDtfsCounter, 3885 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:24,140 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.7s Time] [2025-03-03 14:59:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-03 14:59:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2975. [2025-03-03 14:59:24,248 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:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3779 transitions. [2025-03-03 14:59:24,263 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3779 transitions. Word has length 208 [2025-03-03 14:59:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:24,264 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 3779 transitions. [2025-03-03 14:59:24,264 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:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3779 transitions. [2025-03-03 14:59:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:24,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:24,268 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:24,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:59:24,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash -7794052, now seen corresponding path program 1 times [2025-03-03 14:59:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93288835] [2025-03-03 14:59:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:24,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:24,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:25,327 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:25,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93288835] [2025-03-03 14:59:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93288835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962510192] [2025-03-03 14:59:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:25,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:25,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:25,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:25,329 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:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:27,795 INFO L93 Difference]: Finished difference Result 6457 states and 8262 transitions. [2025-03-03 14:59:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:27,796 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:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:27,815 INFO L225 Difference]: With dead ends: 6457 [2025-03-03 14:59:27,815 INFO L226 Difference]: Without dead ends: 3487 [2025-03-03 14:59:27,830 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:27,830 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:27,831 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:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-03-03 14:59:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3349. [2025-03-03 14:59:27,931 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:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4314 transitions. [2025-03-03 14:59:27,980 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4314 transitions. Word has length 209 [2025-03-03 14:59:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:27,980 INFO L471 AbstractCegarLoop]: Abstraction has 3349 states and 4314 transitions. [2025-03-03 14:59:27,981 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:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4314 transitions. [2025-03-03 14:59:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 14:59:27,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:27,987 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:27,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:59:27,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:27,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:27,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1414813080, now seen corresponding path program 1 times [2025-03-03 14:59:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:27,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734124535] [2025-03-03 14:59:27,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:28,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 14:59:28,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 14:59:28,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:28,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:29,793 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:29,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734124535] [2025-03-03 14:59:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734124535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:59:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875069786] [2025-03-03 14:59:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:29,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:29,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:59:29,795 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:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:31,855 INFO L93 Difference]: Finished difference Result 7067 states and 9166 transitions. [2025-03-03 14:59:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:31,855 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:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:31,874 INFO L225 Difference]: With dead ends: 7067 [2025-03-03 14:59:31,874 INFO L226 Difference]: Without dead ends: 3723 [2025-03-03 14:59:31,886 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:31,888 INFO L435 NwaCegarLoop]: 3420 mSDtfsCounter, 5685 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:31,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5685 Valid, 6025 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:59:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2025-03-03 14:59:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2025-03-03 14:59:31,992 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:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4848 transitions. [2025-03-03 14:59:32,008 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4848 transitions. Word has length 205 [2025-03-03 14:59:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:32,008 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 4848 transitions. [2025-03-03 14:59:32,008 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:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4848 transitions. [2025-03-03 14:59:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:59:32,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:32,013 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:32,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:59:32,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash 972951326, now seen corresponding path program 1 times [2025-03-03 14:59:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760432958] [2025-03-03 14:59:32,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:32,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:32,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:32,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:32,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:32,841 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:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760432958] [2025-03-03 14:59:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760432958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261478579] [2025-03-03 14:59:32,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:32,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:32,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:32,844 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:32,846 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:33,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:59:33,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:59:33,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:33,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:33,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:59:33,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:33,980 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:33,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261478579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:33,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218949406] [2025-03-03 14:59:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:33,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:33,984 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:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:35,569 INFO L93 Difference]: Finished difference Result 7674 states and 9983 transitions. [2025-03-03 14:59:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:35,570 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:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:35,589 INFO L225 Difference]: With dead ends: 7674 [2025-03-03 14:59:35,589 INFO L226 Difference]: Without dead ends: 3844 [2025-03-03 14:59:35,602 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:35,603 INFO L435 NwaCegarLoop]: 3598 mSDtfsCounter, 1465 mSDsluCounter, 6334 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:35,603 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.4s Time] [2025-03-03 14:59:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-03-03 14:59:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3708. [2025-03-03 14:59:35,698 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:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 4824 transitions. [2025-03-03 14:59:35,716 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 4824 transitions. Word has length 208 [2025-03-03 14:59:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:35,716 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 4824 transitions. [2025-03-03 14:59:35,717 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:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4824 transitions. [2025-03-03 14:59:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:59:35,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:35,722 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:35,737 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:35,922 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:35,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:35,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash -292046140, now seen corresponding path program 1 times [2025-03-03 14:59:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:35,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777871765] [2025-03-03 14:59:35,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:36,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:36,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:36,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:36,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:36,844 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:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777871765] [2025-03-03 14:59:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777871765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000951969] [2025-03-03 14:59:36,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:36,849 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:36,850 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:37,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:59:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:59:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:37,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:37,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:38,056 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:38,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000951969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:38,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:38,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:38,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45461525] [2025-03-03 14:59:38,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:38,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:38,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:38,060 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:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:39,143 INFO L93 Difference]: Finished difference Result 7605 states and 9878 transitions. [2025-03-03 14:59:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:39,143 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:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:39,158 INFO L225 Difference]: With dead ends: 7605 [2025-03-03 14:59:39,158 INFO L226 Difference]: Without dead ends: 3836 [2025-03-03 14:59:39,168 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:39,169 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:39,169 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:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2025-03-03 14:59:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 3698. [2025-03-03 14:59:39,261 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:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4805 transitions. [2025-03-03 14:59:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4805 transitions. Word has length 209 [2025-03-03 14:59:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:39,276 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 4805 transitions. [2025-03-03 14:59:39,276 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:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4805 transitions. [2025-03-03 14:59:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:39,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:39,279 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:39,292 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:39,480 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:39,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash -603552259, now seen corresponding path program 1 times [2025-03-03 14:59:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:39,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908719564] [2025-03-03 14:59:39,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:39,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:40,137 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:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908719564] [2025-03-03 14:59:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908719564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103705049] [2025-03-03 14:59:40,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:40,140 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:40,142 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:40,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:41,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:41,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:41,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:41,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:41,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:41,236 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:41,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103705049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:41,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145135827] [2025-03-03 14:59:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:41,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:41,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:41,237 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:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:42,486 INFO L93 Difference]: Finished difference Result 8208 states and 10668 transitions. [2025-03-03 14:59:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:42,487 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:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:42,507 INFO L225 Difference]: With dead ends: 8208 [2025-03-03 14:59:42,507 INFO L226 Difference]: Without dead ends: 4515 [2025-03-03 14:59:42,519 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:42,519 INFO L435 NwaCegarLoop]: 3806 mSDtfsCounter, 1741 mSDsluCounter, 6895 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 10701 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:42,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 10701 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:59:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2025-03-03 14:59:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4186. [2025-03-03 14:59:42,620 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:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5514 transitions. [2025-03-03 14:59:42,640 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5514 transitions. Word has length 210 [2025-03-03 14:59:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:42,641 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5514 transitions. [2025-03-03 14:59:42,641 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:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5514 transitions. [2025-03-03 14:59:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 14:59:42,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:42,646 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:42,658 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:42,846 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:42,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 916495161, now seen corresponding path program 1 times [2025-03-03 14:59:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886908641] [2025-03-03 14:59:42,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:43,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:43,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:43,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:43,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:43,671 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 14:59:43,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886908641] [2025-03-03 14:59:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886908641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620127072] [2025-03-03 14:59:43,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:43,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:43,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:43,673 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 14:59:43,675 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 14:59:44,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 14:59:44,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 14:59:44,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:44,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:44,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:44,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:44,794 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 14:59:44,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:44,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620127072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:44,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:44,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-03-03 14:59:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143638037] [2025-03-03 14:59:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:44,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:44,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:44,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:44,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:59:44,796 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 14:59:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:45,798 INFO L93 Difference]: Finished difference Result 8369 states and 11032 transitions. [2025-03-03 14:59:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:45,798 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 14:59:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:45,826 INFO L225 Difference]: With dead ends: 8369 [2025-03-03 14:59:45,826 INFO L226 Difference]: Without dead ends: 4188 [2025-03-03 14:59:45,839 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:45,840 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.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:45,840 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.9s Time] [2025-03-03 14:59:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-03-03 14:59:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4186. [2025-03-03 14:59:45,954 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 14:59:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5513 transitions. [2025-03-03 14:59:45,969 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5513 transitions. Word has length 210 [2025-03-03 14:59:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:45,970 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5513 transitions. [2025-03-03 14:59:45,970 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 14:59:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5513 transitions. [2025-03-03 14:59:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:45,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:45,974 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 14:59:45,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:46,175 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 14:59:46,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1278122663, now seen corresponding path program 1 times [2025-03-03 14:59:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69756112] [2025-03-03 14:59:46,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:46,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:46,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:46,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:46,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:46,809 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 14:59:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69756112] [2025-03-03 14:59:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69756112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:46,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404185400] [2025-03-03 14:59:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:46,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:46,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:46,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:46,811 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 14:59:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:48,420 INFO L93 Difference]: Finished difference Result 7873 states and 10305 transitions. [2025-03-03 14:59:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:48,420 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 14:59:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:48,433 INFO L225 Difference]: With dead ends: 7873 [2025-03-03 14:59:48,433 INFO L226 Difference]: Without dead ends: 3692 [2025-03-03 14:59:48,444 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 14:59:48,444 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 14:59:48,444 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 14:59:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-03-03 14:59:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3690. [2025-03-03 14:59:48,518 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 14:59:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4788 transitions. [2025-03-03 14:59:48,530 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4788 transitions. Word has length 220 [2025-03-03 14:59:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:48,531 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4788 transitions. [2025-03-03 14:59:48,531 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 14:59:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4788 transitions. [2025-03-03 14:59:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:48,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:48,534 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 14:59:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:59:48,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1104207979, now seen corresponding path program 1 times [2025-03-03 14:59:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583034112] [2025-03-03 14:59:48,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:48,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:48,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:49,333 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 14:59:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583034112] [2025-03-03 14:59:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583034112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:59:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588183429] [2025-03-03 14:59:49,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:59:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:59:49,336 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 14:59:49,337 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 14:59:50,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:50,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:50,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:50,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:50,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:59:50,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:59:50,444 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 14:59:50,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:59:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588183429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:50,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:59:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-03 14:59:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792745738] [2025-03-03 14:59:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:50,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:59:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:50,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:59:50,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:59:50,445 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 14:59:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:51,711 INFO L93 Difference]: Finished difference Result 7375 states and 9577 transitions. [2025-03-03 14:59:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:51,711 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 14:59:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:51,723 INFO L225 Difference]: With dead ends: 7375 [2025-03-03 14:59:51,724 INFO L226 Difference]: Without dead ends: 3690 [2025-03-03 14:59:51,733 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 14:59:51,734 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:51,734 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.1s Time] [2025-03-03 14:59:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-03 14:59:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-03 14:59:51,811 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 14:59:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4784 transitions. [2025-03-03 14:59:51,825 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4784 transitions. Word has length 220 [2025-03-03 14:59:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4784 transitions. [2025-03-03 14:59:51,826 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 14:59:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4784 transitions. [2025-03-03 14:59:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:59:51,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:51,830 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 14:59:51,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:59:52,031 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 14:59:52,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 900710429, now seen corresponding path program 1 times [2025-03-03 14:59:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287225236] [2025-03-03 14:59:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:52,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:59:52,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:59:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:52,737 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 14:59:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287225236] [2025-03-03 14:59:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287225236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943773225] [2025-03-03 14:59:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:52,738 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 14:59:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:54,496 INFO L93 Difference]: Finished difference Result 7373 states and 9571 transitions. [2025-03-03 14:59:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:59:54,497 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 14:59:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:54,514 INFO L225 Difference]: With dead ends: 7373 [2025-03-03 14:59:54,514 INFO L226 Difference]: Without dead ends: 3690 [2025-03-03 14:59:54,527 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 14:59:54,528 INFO L435 NwaCegarLoop]: 3392 mSDtfsCounter, 3626 mSDsluCounter, 5178 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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 14:59:54,528 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 14:59:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-03 14:59:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-03-03 14:59:54,622 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 14:59:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4783 transitions. [2025-03-03 14:59:54,636 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4783 transitions. Word has length 220 [2025-03-03 14:59:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:54,637 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4783 transitions. [2025-03-03 14:59:54,637 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 14:59:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4783 transitions. [2025-03-03 14:59:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 14:59:54,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:54,640 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 14:59:54,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:59:54,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1019062079, now seen corresponding path program 1 times [2025-03-03 14:59:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150094628] [2025-03-03 14:59:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:54,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 14:59:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 14:59:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:55,256 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 14:59:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150094628] [2025-03-03 14:59:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150094628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316384729] [2025-03-03 14:59:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:55,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:55,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:55,258 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 14:59:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:57,025 INFO L93 Difference]: Finished difference Result 7505 states and 9717 transitions. [2025-03-03 14:59:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:57,025 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 14:59:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:57,041 INFO L225 Difference]: With dead ends: 7505 [2025-03-03 14:59:57,041 INFO L226 Difference]: Without dead ends: 3822 [2025-03-03 14:59:57,053 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:57,053 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 14:59:57,054 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 14:59:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2025-03-03 14:59:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3686. [2025-03-03 14:59:57,139 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 14:59:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4779 transitions. [2025-03-03 14:59:57,154 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4779 transitions. Word has length 223 [2025-03-03 14:59:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:57,155 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4779 transitions. [2025-03-03 14:59:57,155 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 14:59:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4779 transitions. [2025-03-03 14:59:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 14:59:57,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:57,157 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 14:59:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:59:57,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 922640830, now seen corresponding path program 1 times [2025-03-03 14:59:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006746888] [2025-03-03 14:59:57,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:57,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:59:57,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:59:57,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:59:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:59:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:59:57,821 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 14:59:57,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:59:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006746888] [2025-03-03 14:59:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006746888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:59:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:59:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:59:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387537711] [2025-03-03 14:59:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:59:57,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:59:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:59:57,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:59:57,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:59:57,823 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 14:59:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:59:59,643 INFO L93 Difference]: Finished difference Result 7501 states and 9709 transitions. [2025-03-03 14:59:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:59:59,643 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 14:59:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:59:59,656 INFO L225 Difference]: With dead ends: 7501 [2025-03-03 14:59:59,656 INFO L226 Difference]: Without dead ends: 3820 [2025-03-03 14:59:59,667 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:59,668 INFO L435 NwaCegarLoop]: 3503 mSDtfsCounter, 6683 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:59:59,668 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.6s Time] [2025-03-03 14:59:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-03-03 14:59:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3682. [2025-03-03 14:59:59,748 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 14:59:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4771 transitions. [2025-03-03 14:59:59,761 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4771 transitions. Word has length 224 [2025-03-03 14:59:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:59:59,762 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4771 transitions. [2025-03-03 14:59:59,762 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 14:59:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4771 transitions. [2025-03-03 14:59:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 14:59:59,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:59:59,764 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 14:59:59,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:59:59,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:59:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:59:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1252649154, now seen corresponding path program 1 times [2025-03-03 14:59:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:59:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113606405] [2025-03-03 14:59:59,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:59:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:00,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 15:00:00,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 15:00:00,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:00,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:00,424 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:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:00,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113606405] [2025-03-03 15:00:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113606405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549943718] [2025-03-03 15:00:00,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:00,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:00,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:00,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:00,425 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:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:02,477 INFO L93 Difference]: Finished difference Result 7357 states and 9541 transitions. [2025-03-03 15:00:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:02,477 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:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:02,490 INFO L225 Difference]: With dead ends: 7357 [2025-03-03 15:00:02,490 INFO L226 Difference]: Without dead ends: 3680 [2025-03-03 15:00:02,500 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:02,501 INFO L435 NwaCegarLoop]: 3477 mSDtfsCounter, 5728 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:02,501 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.8s Time] [2025-03-03 15:00:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-03-03 15:00:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-03-03 15:00:02,584 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:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4763 transitions. [2025-03-03 15:00:02,598 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4763 transitions. Word has length 225 [2025-03-03 15:00:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:02,598 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4763 transitions. [2025-03-03 15:00:02,599 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:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4763 transitions. [2025-03-03 15:00:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 15:00:02,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:02,601 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:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:00:02,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash 649721093, now seen corresponding path program 1 times [2025-03-03 15:00:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686312161] [2025-03-03 15:00:02,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 15:00:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 15:00:02,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:02,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:03,246 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:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686312161] [2025-03-03 15:00:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686312161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:03,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:03,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714131985] [2025-03-03 15:00:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:03,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:03,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:03,247 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:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:04,931 INFO L93 Difference]: Finished difference Result 7353 states and 9529 transitions. [2025-03-03 15:00:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:04,934 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:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:04,949 INFO L225 Difference]: With dead ends: 7353 [2025-03-03 15:00:04,949 INFO L226 Difference]: Without dead ends: 3680 [2025-03-03 15:00:04,962 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:04,962 INFO L435 NwaCegarLoop]: 3371 mSDtfsCounter, 6425 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:04,963 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.5s Time] [2025-03-03 15:00:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-03-03 15:00:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-03-03 15:00:05,043 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:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4762 transitions. [2025-03-03 15:00:05,057 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4762 transitions. Word has length 225 [2025-03-03 15:00:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:05,058 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4762 transitions. [2025-03-03 15:00:05,058 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:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4762 transitions. [2025-03-03 15:00:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 15:00:05,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:05,060 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:05,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:00:05,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1765688453, now seen corresponding path program 1 times [2025-03-03 15:00:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:05,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138105822] [2025-03-03 15:00:05,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 15:00:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 15:00:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:05,750 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:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138105822] [2025-03-03 15:00:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138105822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:05,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:05,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471013329] [2025-03-03 15:00:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:05,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:05,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:05,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:05,752 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:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:07,656 INFO L93 Difference]: Finished difference Result 7485 states and 9675 transitions. [2025-03-03 15:00:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:07,656 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:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:07,668 INFO L225 Difference]: With dead ends: 7485 [2025-03-03 15:00:07,668 INFO L226 Difference]: Without dead ends: 3812 [2025-03-03 15:00:07,678 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:07,679 INFO L435 NwaCegarLoop]: 3604 mSDtfsCounter, 5789 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:07,679 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.7s Time] [2025-03-03 15:00:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2025-03-03 15:00:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3676. [2025-03-03 15:00:07,758 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:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4758 transitions. [2025-03-03 15:00:07,771 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4758 transitions. Word has length 228 [2025-03-03 15:00:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4758 transitions. [2025-03-03 15:00:07,772 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:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4758 transitions. [2025-03-03 15:00:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 15:00:07,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:07,774 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:07,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:00:07,774 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1737631225, now seen corresponding path program 1 times [2025-03-03 15:00:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:07,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759348184] [2025-03-03 15:00:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:08,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 15:00:08,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 15:00:08,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:08,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:08,473 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:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759348184] [2025-03-03 15:00:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759348184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:08,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830018259] [2025-03-03 15:00:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:08,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:08,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:08,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:08,475 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:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:10,110 INFO L93 Difference]: Finished difference Result 7481 states and 9667 transitions. [2025-03-03 15:00:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:10,110 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:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:10,125 INFO L225 Difference]: With dead ends: 7481 [2025-03-03 15:00:10,125 INFO L226 Difference]: Without dead ends: 3810 [2025-03-03 15:00:10,137 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:10,137 INFO L435 NwaCegarLoop]: 3495 mSDtfsCounter, 4667 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:10,137 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.4s Time] [2025-03-03 15:00:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2025-03-03 15:00:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3672. [2025-03-03 15:00:10,227 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:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4750 transitions. [2025-03-03 15:00:10,242 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4750 transitions. Word has length 229 [2025-03-03 15:00:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:10,243 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 4750 transitions. [2025-03-03 15:00:10,243 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:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4750 transitions. [2025-03-03 15:00:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:10,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:10,245 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:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:00:10,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:10,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1506553926, now seen corresponding path program 1 times [2025-03-03 15:00:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329647497] [2025-03-03 15:00:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:10,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:10,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:10,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:10,898 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:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329647497] [2025-03-03 15:00:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329647497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:00:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662530281] [2025-03-03 15:00:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:10,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:00:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:00:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:00:10,899 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:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:12,637 INFO L93 Difference]: Finished difference Result 7337 states and 9499 transitions. [2025-03-03 15:00:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:00:12,637 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:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:12,652 INFO L225 Difference]: With dead ends: 7337 [2025-03-03 15:00:12,652 INFO L226 Difference]: Without dead ends: 3670 [2025-03-03 15:00:12,664 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:12,665 INFO L435 NwaCegarLoop]: 3469 mSDtfsCounter, 6624 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:12,665 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.6s Time] [2025-03-03 15:00:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-03-03 15:00:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-03-03 15:00:12,761 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:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4742 transitions. [2025-03-03 15:00:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4742 transitions. Word has length 230 [2025-03-03 15:00:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:12,777 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4742 transitions. [2025-03-03 15:00:12,777 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:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4742 transitions. [2025-03-03 15:00:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 15:00:12,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:12,779 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:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:00:12,779 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:12,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1006211798, now seen corresponding path program 1 times [2025-03-03 15:00:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:12,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518521247] [2025-03-03 15:00:12,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:13,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 15:00:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 15:00:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:13,495 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:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:13,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518521247] [2025-03-03 15:00:13,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518521247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:13,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595787193] [2025-03-03 15:00:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:13,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:13,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:13,497 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:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:13,979 INFO L93 Difference]: Finished difference Result 7333 states and 9486 transitions. [2025-03-03 15:00:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:13,979 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:13,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:13,992 INFO L225 Difference]: With dead ends: 7333 [2025-03-03 15:00:13,992 INFO L226 Difference]: Without dead ends: 3670 [2025-03-03 15:00:14,003 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:14,004 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:14,004 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:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-03-03 15:00:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-03-03 15:00:14,081 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:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4741 transitions. [2025-03-03 15:00:14,094 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4741 transitions. Word has length 230 [2025-03-03 15:00:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:14,095 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4741 transitions. [2025-03-03 15:00:14,095 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:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4741 transitions. [2025-03-03 15:00:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 15:00:14,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:14,097 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:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:00:14,097 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 541198440, now seen corresponding path program 1 times [2025-03-03 15:00:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251553556] [2025-03-03 15:00:14,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:14,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 15:00:14,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 15:00:14,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:14,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:14,677 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:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251553556] [2025-03-03 15:00:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251553556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107441023] [2025-03-03 15:00:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:14,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:14,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:14,678 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:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:15,575 INFO L93 Difference]: Finished difference Result 7465 states and 9632 transitions. [2025-03-03 15:00:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:15,575 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:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:15,590 INFO L225 Difference]: With dead ends: 7465 [2025-03-03 15:00:15,591 INFO L226 Difference]: Without dead ends: 3802 [2025-03-03 15:00:15,602 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:15,602 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.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:15,602 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.8s Time] [2025-03-03 15:00:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-03-03 15:00:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3666. [2025-03-03 15:00:15,685 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:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4737 transitions. [2025-03-03 15:00:15,701 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4737 transitions. Word has length 233 [2025-03-03 15:00:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:15,702 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 4737 transitions. [2025-03-03 15:00:15,702 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:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4737 transitions. [2025-03-03 15:00:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 15:00:15,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:15,704 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:15,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:00:15,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash 728584291, now seen corresponding path program 1 times [2025-03-03 15:00:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919613434] [2025-03-03 15:00:15,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 15:00:16,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 15:00:16,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:16,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:16,317 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:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919613434] [2025-03-03 15:00:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919613434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479108874] [2025-03-03 15:00:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:16,318 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:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:17,316 INFO L93 Difference]: Finished difference Result 7463 states and 9625 transitions. [2025-03-03 15:00:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:17,316 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:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:17,333 INFO L225 Difference]: With dead ends: 7463 [2025-03-03 15:00:17,333 INFO L226 Difference]: Without dead ends: 3802 [2025-03-03 15:00:17,347 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:17,347 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 4502 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:17,347 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.8s Time] [2025-03-03 15:00:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-03-03 15:00:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3664. [2025-03-03 15:00:17,486 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:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4733 transitions. [2025-03-03 15:00:17,506 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4733 transitions. Word has length 234 [2025-03-03 15:00:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:17,507 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4733 transitions. [2025-03-03 15:00:17,507 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:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4733 transitions. [2025-03-03 15:00:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:17,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:17,510 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:17,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:00:17,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:17,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash -652305719, now seen corresponding path program 1 times [2025-03-03 15:00:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339073234] [2025-03-03 15:00:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:17,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:17,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:17,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:17,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:18,210 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:18,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:18,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339073234] [2025-03-03 15:00:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339073234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:18,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:18,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135237249] [2025-03-03 15:00:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:18,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:18,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:18,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:18,212 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:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:18,748 INFO L93 Difference]: Finished difference Result 7323 states and 9465 transitions. [2025-03-03 15:00:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:00:18,749 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:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:18,770 INFO L225 Difference]: With dead ends: 7323 [2025-03-03 15:00:18,770 INFO L226 Difference]: Without dead ends: 3664 [2025-03-03 15:00:18,783 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:18,784 INFO L435 NwaCegarLoop]: 3031 mSDtfsCounter, 2493 mSDsluCounter, 5232 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:18,785 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:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-03 15:00:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-03-03 15:00:18,871 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:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4729 transitions. [2025-03-03 15:00:18,887 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4729 transitions. Word has length 235 [2025-03-03 15:00:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:18,888 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4729 transitions. [2025-03-03 15:00:18,888 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:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4729 transitions. [2025-03-03 15:00:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 15:00:18,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:18,890 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:18,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:00:18,890 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:18,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:18,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1843572456, now seen corresponding path program 1 times [2025-03-03 15:00:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969047077] [2025-03-03 15:00:18,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:19,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 15:00:19,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 15:00:19,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:19,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:00:19,538 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:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:00:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969047077] [2025-03-03 15:00:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969047077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:00:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:00:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:00:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973027276] [2025-03-03 15:00:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:00:19,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:00:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:00:19,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:00:19,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:00:19,539 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:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:00:20,132 INFO L93 Difference]: Finished difference Result 7321 states and 9460 transitions. [2025-03-03 15:00:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:00:20,132 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:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:00:20,151 INFO L225 Difference]: With dead ends: 7321 [2025-03-03 15:00:20,151 INFO L226 Difference]: Without dead ends: 3664 [2025-03-03 15:00:20,163 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:20,164 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:00:20,164 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.5s Time] [2025-03-03 15:00:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-03 15:00:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-03-03 15:00:20,249 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:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4728 transitions. [2025-03-03 15:00:20,266 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4728 transitions. Word has length 235 [2025-03-03 15:00:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:00:20,266 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4728 transitions. [2025-03-03 15:00:20,266 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:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4728 transitions. [2025-03-03 15:00:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 15:00:20,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:00:20,268 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:20,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:00:20,268 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:00:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:00:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 758217460, now seen corresponding path program 1 times [2025-03-03 15:00:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:00:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571934132] [2025-03-03 15:00:20,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:00:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:00:20,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 15:00:20,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 15:00:20,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:00:20,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat