./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:11:04,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:11:04,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:11:04,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:11:04,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:11:04,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:11:04,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:11:04,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:11:04,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:11:04,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:11:04,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:11:04,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:11:04,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:11:04,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:11:04,186 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:11:04,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:11:04,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:11:04,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:11:04,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:11:04,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:11:04,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:11:04,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:11:04,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:11:04,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:11:04,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:11:04,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:11:04,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:11:04,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:11:04,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:11:04,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:11:04,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:11:04,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:11:04,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:11:04,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:11:04,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:11:04,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:11:04,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:11:04,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:11:04,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:11:04,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:11:04,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:11:04,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:11:04,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2024-11-10 00:11:04,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:11:04,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:11:04,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:11:04,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:11:04,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:11:04,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2024-11-10 00:11:05,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:11:06,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:11:06,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2024-11-10 00:11:06,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941b7e579/110d4b1add334d6587c93797e0bb0721/FLAG9100bb71a [2024-11-10 00:11:06,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941b7e579/110d4b1add334d6587c93797e0bb0721 [2024-11-10 00:11:06,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:11:06,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:11:06,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:11:06,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:11:06,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:11:06,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:06" (1/1) ... [2024-11-10 00:11:06,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3d5dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:06, skipping insertion in model container [2024-11-10 00:11:06,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:11:06" (1/1) ... [2024-11-10 00:11:06,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:11:06,895 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-pthread/cs_sync.i[34698,34711] [2024-11-10 00:11:07,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:11:07,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:11:07,088 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-pthread/cs_sync.i[34698,34711] [2024-11-10 00:11:07,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:11:07,212 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:11:07,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07 WrapperNode [2024-11-10 00:11:07,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:11:07,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:11:07,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:11:07,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:11:07,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,314 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 555 [2024-11-10 00:11:07,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:11:07,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:11:07,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:11:07,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:11:07,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,390 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [2, 8, 8, 8, 20, 16, 12, 8, 0, 6, 12, 3, 3, 7, 3, 3, 7]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 3, 3, 3, 6, 6, 2, 4, 0, 2, 2, 0, 0, 0, 0, 0, 0]. The 38 writes are split as follows [0, 2, 2, 2, 8, 5, 4, 2, 0, 2, 5, 1, 1, 1, 1, 1, 1]. [2024-11-10 00:11:07,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:11:07,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:11:07,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:11:07,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:11:07,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (1/1) ... [2024-11-10 00:11:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:11:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:07,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:11:07,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:11:07,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 00:11:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 00:11:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 00:11:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2024-11-10 00:11:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2024-11-10 00:11:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-10 00:11:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-10 00:11:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 00:11:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 00:11:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 00:11:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 00:11:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-10 00:11:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-10 00:11:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-10 00:11:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-10 00:11:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-10 00:11:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-10 00:11:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-10 00:11:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-10 00:11:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-10 00:11:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-10 00:11:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-10 00:11:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-10 00:11:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-10 00:11:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-10 00:11:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-10 00:11:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-10 00:11:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-10 00:11:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-10 00:11:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-10 00:11:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-10 00:11:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-10 00:11:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 00:11:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-10 00:11:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2024-11-10 00:11:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 00:11:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 00:11:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 00:11:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 00:11:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 00:11:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-10 00:11:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-10 00:11:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 00:11:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-10 00:11:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-10 00:11:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-10 00:11:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2024-11-10 00:11:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2024-11-10 00:11:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-10 00:11:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-10 00:11:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-10 00:11:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-10 00:11:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-10 00:11:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-10 00:11:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:11:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 00:11:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 00:11:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 00:11:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 00:11:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 00:11:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 00:11:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-10 00:11:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-10 00:11:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-10 00:11:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-10 00:11:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-10 00:11:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:11:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:11:07,835 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:11:07,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:11:08,374 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:11:08,375 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:11:08,375 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:11:08,376 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:11:08,376 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:11:08,376 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:11:08,376 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-10 00:11:08,376 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-10 00:11:08,377 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2024-11-10 00:11:08,737 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-10 00:11:08,738 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:11:08,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:11:08,761 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:11:08,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:11:08 BoogieIcfgContainer [2024-11-10 00:11:08,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:11:08,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:11:08,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:11:08,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:11:08,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:11:06" (1/3) ... [2024-11-10 00:11:08,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3ab0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:11:08, skipping insertion in model container [2024-11-10 00:11:08,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:11:07" (2/3) ... [2024-11-10 00:11:08,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3ab0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:11:08, skipping insertion in model container [2024-11-10 00:11:08,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:11:08" (3/3) ... [2024-11-10 00:11:08,772 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2024-11-10 00:11:08,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:11:08,790 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 00:11:08,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:11:08,881 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;@43ea9a1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:11:08,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 00:11:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 128 states have internal predecessors, (184), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 00:11:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:11:08,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:08,903 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:08,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 719630430, now seen corresponding path program 1 times [2024-11-10 00:11:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280697953] [2024-11-10 00:11:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-10 00:11:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 00:11:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:09,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:09,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280697953] [2024-11-10 00:11:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280697953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:09,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:11:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061817418] [2024-11-10 00:11:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:09,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:11:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:11:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:11:09,452 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 128 states have internal predecessors, (184), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:09,508 INFO L93 Difference]: Finished difference Result 385 states and 630 transitions. [2024-11-10 00:11:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:11:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-10 00:11:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:09,520 INFO L225 Difference]: With dead ends: 385 [2024-11-10 00:11:09,520 INFO L226 Difference]: Without dead ends: 189 [2024-11-10 00:11:09,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:11:09,530 INFO L432 NwaCegarLoop]: 286 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, 286 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:09,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-10 00:11:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-10 00:11:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 123 states have internal predecessors, (172), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 00:11:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2024-11-10 00:11:09,590 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 282 transitions. Word has length 73 [2024-11-10 00:11:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 282 transitions. [2024-11-10 00:11:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2024-11-10 00:11:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 00:11:09,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:09,603 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:11:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:11:09,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -173092533, now seen corresponding path program 1 times [2024-11-10 00:11:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66061488] [2024-11-10 00:11:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 00:11:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 00:11:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 00:11:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 00:11:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 00:11:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 00:11:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 00:11:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-10 00:11:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 00:11:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 00:11:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:09,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:09,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66061488] [2024-11-10 00:11:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66061488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:09,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:09,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:11:09,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17861742] [2024-11-10 00:11:09,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:09,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:11:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:11:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:09,958 INFO L87 Difference]: Start difference. First operand 189 states and 282 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:10,022 INFO L93 Difference]: Finished difference Result 376 states and 562 transitions. [2024-11-10 00:11:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:11:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-11-10 00:11:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:10,030 INFO L225 Difference]: With dead ends: 376 [2024-11-10 00:11:10,030 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 00:11:10,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:10,033 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 4 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:10,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 556 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 00:11:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-10 00:11:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.392) internal successors, (174), 125 states have internal predecessors, (174), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 00:11:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2024-11-10 00:11:10,071 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 74 [2024-11-10 00:11:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:10,072 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2024-11-10 00:11:10,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2024-11-10 00:11:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:11:10,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:10,079 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2024-11-10 00:11:10,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:11:10,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:10,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1689884605, now seen corresponding path program 1 times [2024-11-10 00:11:10,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:10,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390276029] [2024-11-10 00:11:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 00:11:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390276029] [2024-11-10 00:11:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390276029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:10,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:10,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:11:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286252344] [2024-11-10 00:11:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:10,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:11:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:10,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:11:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:10,342 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:10,381 INFO L93 Difference]: Finished difference Result 380 states and 567 transitions. [2024-11-10 00:11:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:11:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 79 [2024-11-10 00:11:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:10,400 INFO L225 Difference]: With dead ends: 380 [2024-11-10 00:11:10,401 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 00:11:10,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:11:10,406 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:10,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 00:11:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-10 00:11:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 127 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 00:11:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 286 transitions. [2024-11-10 00:11:10,425 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 286 transitions. Word has length 79 [2024-11-10 00:11:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:10,425 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 286 transitions. [2024-11-10 00:11:10,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 286 transitions. [2024-11-10 00:11:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:11:10,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:10,428 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2024-11-10 00:11:10,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:11:10,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:10,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -203719746, now seen corresponding path program 1 times [2024-11-10 00:11:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:10,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197731601] [2024-11-10 00:11:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 00:11:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 00:11:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 00:11:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 00:11:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 00:11:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 00:11:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 00:11:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 00:11:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 00:11:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 00:11:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197731601] [2024-11-10 00:11:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197731601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197814483] [2024-11-10 00:11:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:10,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:10,667 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) [2024-11-10 00:11:10,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:11:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 00:11:11,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:11,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 00:11:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197814483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:11,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-10 00:11:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823064350] [2024-11-10 00:11:11,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:11:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:11:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:11:11,186 INFO L87 Difference]: Start difference. First operand 193 states and 286 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 00:11:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:11,262 INFO L93 Difference]: Finished difference Result 386 states and 574 transitions. [2024-11-10 00:11:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:11:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 81 [2024-11-10 00:11:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:11,266 INFO L225 Difference]: With dead ends: 386 [2024-11-10 00:11:11,269 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 00:11:11,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:11:11,272 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 00:11:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-10 00:11:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 131 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-10 00:11:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2024-11-10 00:11:11,303 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2024-11-10 00:11:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:11,304 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2024-11-10 00:11:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 00:11:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2024-11-10 00:11:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:11:11,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:11,307 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 3, 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] [2024-11-10 00:11:11,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:11:11,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:11,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -441295104, now seen corresponding path program 2 times [2024-11-10 00:11:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428083238] [2024-11-10 00:11:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 00:11:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 00:11:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 00:11:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 00:11:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 00:11:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 00:11:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 00:11:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 00:11:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-10 00:11:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428083238] [2024-11-10 00:11:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428083238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104210842] [2024-11-10 00:11:11,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 00:11:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:11,747 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) [2024-11-10 00:11:11,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:11:12,055 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 00:11:12,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 00:11:12,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 00:11:12,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-10 00:11:12,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:11:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104210842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 00:11:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-10 00:11:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865440840] [2024-11-10 00:11:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:11:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:11:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:11:12,223 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:12,284 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2024-11-10 00:11:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:11:12,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 85 [2024-11-10 00:11:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:12,293 INFO L225 Difference]: With dead ends: 376 [2024-11-10 00:11:12,293 INFO L226 Difference]: Without dead ends: 349 [2024-11-10 00:11:12,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:11:12,295 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 226 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:12,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 959 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:11:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-10 00:11:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2024-11-10 00:11:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 228 states have (on average 1.4078947368421053) internal successors, (321), 228 states have internal predecessors, (321), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2024-11-10 00:11:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 527 transitions. [2024-11-10 00:11:12,327 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 527 transitions. Word has length 85 [2024-11-10 00:11:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 527 transitions. [2024-11-10 00:11:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 00:11:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 527 transitions. [2024-11-10 00:11:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 00:11:12,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:12,337 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2024-11-10 00:11:12,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:11:12,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:12,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:12,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1981598368, now seen corresponding path program 1 times [2024-11-10 00:11:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606321309] [2024-11-10 00:11:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 00:11:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 00:11:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 00:11:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 00:11:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 00:11:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 00:11:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-10 00:11:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 00:11:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 00:11:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 00:11:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 00:11:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 00:11:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 00:11:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 00:11:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 00:11:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-11-10 00:11:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606321309] [2024-11-10 00:11:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606321309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895131827] [2024-11-10 00:11:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:13,168 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) [2024-11-10 00:11:13,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:11:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:13,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 00:11:13,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-11-10 00:11:13,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-11-10 00:11:13,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895131827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:13,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:13,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2024-11-10 00:11:13,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13084334] [2024-11-10 00:11:13,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:13,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:13,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:13,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:13,876 INFO L87 Difference]: Start difference. First operand 348 states and 527 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (48), 6 states have call predecessors, (48), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 00:11:17,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:18,825 INFO L93 Difference]: Finished difference Result 716 states and 1085 transitions. [2024-11-10 00:11:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:11:18,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (48), 6 states have call predecessors, (48), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 194 [2024-11-10 00:11:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:18,830 INFO L225 Difference]: With dead ends: 716 [2024-11-10 00:11:18,831 INFO L226 Difference]: Without dead ends: 383 [2024-11-10 00:11:18,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:11:18,835 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 123 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 164 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:18,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 924 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 552 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-10 00:11:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-10 00:11:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 363. [2024-11-10 00:11:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3900414937759336) internal successors, (335), 243 states have internal predecessors, (335), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2024-11-10 00:11:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 545 transitions. [2024-11-10 00:11:18,877 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 545 transitions. Word has length 194 [2024-11-10 00:11:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:18,878 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 545 transitions. [2024-11-10 00:11:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (48), 6 states have call predecessors, (48), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 00:11:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 545 transitions. [2024-11-10 00:11:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 00:11:18,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:18,882 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-10 00:11:18,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:11:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:19,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:19,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -614145415, now seen corresponding path program 1 times [2024-11-10 00:11:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030177439] [2024-11-10 00:11:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-10 00:11:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 00:11:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 00:11:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 00:11:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 00:11:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 00:11:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 00:11:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 00:11:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 00:11:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 00:11:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 00:11:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 00:11:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-11-10 00:11:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030177439] [2024-11-10 00:11:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030177439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:11:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009086534] [2024-11-10 00:11:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:20,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:11:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:11:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:11:20,033 INFO L87 Difference]: Start difference. First operand 363 states and 545 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:21,605 INFO L93 Difference]: Finished difference Result 1049 states and 1597 transitions. [2024-11-10 00:11:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:11:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 190 [2024-11-10 00:11:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:21,612 INFO L225 Difference]: With dead ends: 1049 [2024-11-10 00:11:21,612 INFO L226 Difference]: Without dead ends: 729 [2024-11-10 00:11:21,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:11:21,615 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 468 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:21,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 898 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 00:11:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-10 00:11:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 684. [2024-11-10 00:11:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 444 states have (on average 1.4054054054054055) internal successors, (624), 448 states have internal predecessors, (624), 195 states have call successors, (195), 40 states have call predecessors, (195), 44 states have return successors, (226), 195 states have call predecessors, (226), 195 states have call successors, (226) [2024-11-10 00:11:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1045 transitions. [2024-11-10 00:11:21,690 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1045 transitions. Word has length 190 [2024-11-10 00:11:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:21,690 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1045 transitions. [2024-11-10 00:11:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 00:11:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1045 transitions. [2024-11-10 00:11:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 00:11:21,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:21,696 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-10 00:11:21,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:11:21,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:21,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1138437581, now seen corresponding path program 1 times [2024-11-10 00:11:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:21,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092634028] [2024-11-10 00:11:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 00:11:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 00:11:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 00:11:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 00:11:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 00:11:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 00:11:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 00:11:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 00:11:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 00:11:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 00:11:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 00:11:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 00:11:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-10 00:11:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092634028] [2024-11-10 00:11:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092634028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:22,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:22,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:11:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991849518] [2024-11-10 00:11:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:22,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:11:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:11:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:11:22,490 INFO L87 Difference]: Start difference. First operand 684 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 00:11:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:24,195 INFO L93 Difference]: Finished difference Result 1310 states and 1991 transitions. [2024-11-10 00:11:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 00:11:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 190 [2024-11-10 00:11:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:24,201 INFO L225 Difference]: With dead ends: 1310 [2024-11-10 00:11:24,201 INFO L226 Difference]: Without dead ends: 630 [2024-11-10 00:11:24,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:11:24,205 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 406 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:24,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 996 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 00:11:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-10 00:11:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 594. [2024-11-10 00:11:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 387 states have (on average 1.3410852713178294) internal successors, (519), 391 states have internal predecessors, (519), 168 states have call successors, (168), 35 states have call predecessors, (168), 38 states have return successors, (190), 167 states have call predecessors, (190), 168 states have call successors, (190) [2024-11-10 00:11:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 877 transitions. [2024-11-10 00:11:24,259 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 877 transitions. Word has length 190 [2024-11-10 00:11:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 877 transitions. [2024-11-10 00:11:24,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 00:11:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 877 transitions. [2024-11-10 00:11:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 00:11:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:24,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-10 00:11:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:11:24,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1560744007, now seen corresponding path program 1 times [2024-11-10 00:11:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330619528] [2024-11-10 00:11:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 00:11:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 00:11:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 00:11:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 00:11:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 00:11:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 00:11:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 00:11:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 00:11:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 00:11:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 00:11:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 00:11:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-11-10 00:11:25,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330619528] [2024-11-10 00:11:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330619528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:25,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:25,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:11:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673265196] [2024-11-10 00:11:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:25,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:25,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:25,316 INFO L87 Difference]: Start difference. First operand 594 states and 877 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:29,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:32,367 INFO L93 Difference]: Finished difference Result 674 states and 982 transitions. [2024-11-10 00:11:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:11:32,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 190 [2024-11-10 00:11:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:32,373 INFO L225 Difference]: With dead ends: 674 [2024-11-10 00:11:32,373 INFO L226 Difference]: Without dead ends: 600 [2024-11-10 00:11:32,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:11:32,377 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 416 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 230 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:32,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1029 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 732 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-11-10 00:11:32,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-10 00:11:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 564. [2024-11-10 00:11:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 371 states have (on average 1.3342318059299192) internal successors, (495), 376 states have internal predecessors, (495), 152 states have call successors, (152), 35 states have call predecessors, (152), 40 states have return successors, (177), 152 states have call predecessors, (177), 152 states have call successors, (177) [2024-11-10 00:11:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 824 transitions. [2024-11-10 00:11:32,428 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 824 transitions. Word has length 190 [2024-11-10 00:11:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:32,428 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 824 transitions. [2024-11-10 00:11:32,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-10 00:11:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 824 transitions. [2024-11-10 00:11:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 00:11:32,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:32,432 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-10 00:11:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:11:32,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash -471777261, now seen corresponding path program 1 times [2024-11-10 00:11:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58797267] [2024-11-10 00:11:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 00:11:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-10 00:11:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-10 00:11:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 00:11:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 00:11:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 00:11:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 00:11:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 00:11:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 00:11:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 00:11:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 00:11:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 00:11:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 00:11:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 00:11:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-10 00:11:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-10 00:11:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58797267] [2024-11-10 00:11:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58797267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:11:33,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:11:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 00:11:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183772893] [2024-11-10 00:11:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:11:33,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:11:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:11:33,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:11:33,558 INFO L87 Difference]: Start difference. First operand 564 states and 824 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 00:11:37,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:40,094 INFO L93 Difference]: Finished difference Result 644 states and 927 transitions. [2024-11-10 00:11:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:11:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 190 [2024-11-10 00:11:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:40,103 INFO L225 Difference]: With dead ends: 644 [2024-11-10 00:11:40,104 INFO L226 Difference]: Without dead ends: 530 [2024-11-10 00:11:40,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-10 00:11:40,105 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 337 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:40,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1239 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1186 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-10 00:11:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-10 00:11:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 497. [2024-11-10 00:11:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 326 states have (on average 1.3312883435582823) internal successors, (434), 330 states have internal predecessors, (434), 136 states have call successors, (136), 29 states have call predecessors, (136), 34 states have return successors, (159), 137 states have call predecessors, (159), 136 states have call successors, (159) [2024-11-10 00:11:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 729 transitions. [2024-11-10 00:11:40,175 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 729 transitions. Word has length 190 [2024-11-10 00:11:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 729 transitions. [2024-11-10 00:11:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-10 00:11:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 729 transitions. [2024-11-10 00:11:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-10 00:11:40,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:40,181 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 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] [2024-11-10 00:11:40,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:11:40,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:40,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 599060377, now seen corresponding path program 1 times [2024-11-10 00:11:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054808661] [2024-11-10 00:11:40,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 00:11:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 00:11:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 00:11:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 00:11:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 00:11:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 00:11:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 00:11:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 00:11:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 00:11:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 00:11:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 00:11:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 00:11:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 00:11:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 00:11:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-10 00:11:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-10 00:11:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-10 00:11:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-10 00:11:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 00:11:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 00:11:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 00:11:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 00:11:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2024-11-10 00:11:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054808661] [2024-11-10 00:11:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054808661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486708530] [2024-11-10 00:11:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:41,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:41,457 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) [2024-11-10 00:11:41,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:11:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:42,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 00:11:42,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-10 00:11:42,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:11:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2024-11-10 00:11:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486708530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:11:42,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:11:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-10 00:11:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180240362] [2024-11-10 00:11:42,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:11:42,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 00:11:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:11:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 00:11:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:11:42,918 INFO L87 Difference]: Start difference. First operand 497 states and 729 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 12 states have internal predecessors, (104), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2024-11-10 00:11:46,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 00:11:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:11:50,021 INFO L93 Difference]: Finished difference Result 1277 states and 1912 transitions. [2024-11-10 00:11:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 00:11:50,021 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 12 states have internal predecessors, (104), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 270 [2024-11-10 00:11:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:11:50,029 INFO L225 Difference]: With dead ends: 1277 [2024-11-10 00:11:50,029 INFO L226 Difference]: Without dead ends: 830 [2024-11-10 00:11:50,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:11:50,033 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 828 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 459 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:11:50,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1092 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1292 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-10 00:11:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-10 00:11:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 772. [2024-11-10 00:11:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 502 states have (on average 1.3585657370517927) internal successors, (682), 509 states have internal predecessors, (682), 212 states have call successors, (212), 51 states have call predecessors, (212), 57 states have return successors, (252), 211 states have call predecessors, (252), 212 states have call successors, (252) [2024-11-10 00:11:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1146 transitions. [2024-11-10 00:11:50,126 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1146 transitions. Word has length 270 [2024-11-10 00:11:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:11:50,128 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1146 transitions. [2024-11-10 00:11:50,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5) internal successors, (104), 12 states have internal predecessors, (104), 9 states have call successors, (57), 8 states have call predecessors, (57), 7 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2024-11-10 00:11:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1146 transitions. [2024-11-10 00:11:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-10 00:11:50,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:11:50,137 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 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] [2024-11-10 00:11:50,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:11:50,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:50,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:11:50,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:11:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1399395879, now seen corresponding path program 1 times [2024-11-10 00:11:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:11:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897594375] [2024-11-10 00:11:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:11:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 00:11:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 00:11:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 00:11:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 00:11:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 00:11:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 00:11:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 00:11:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 00:11:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 00:11:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 00:11:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 00:11:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 00:11:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 00:11:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 00:11:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-10 00:11:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 00:11:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 00:11:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 00:11:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-10 00:11:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-11-10 00:11:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-10 00:11:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-10 00:11:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 00:11:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 00:11:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 00:11:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 00:11:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2024-11-10 00:11:53,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:11:53,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897594375] [2024-11-10 00:11:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897594375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:11:53,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797156849] [2024-11-10 00:11:53,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:11:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:11:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:11:53,706 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) [2024-11-10 00:11:53,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:11:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:11:54,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 1755 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 00:11:54,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:11:54,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 00:12:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 00:12:02,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 00:12:02,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-11-10 00:12:04,187 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-10 00:12:04,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-10 00:12:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 1031 proven. 4 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-11-10 00:12:22,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:12:22,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-10 00:12:22,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-10 00:12:23,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-10 00:12:23,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-10 00:12:23,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-10 00:12:23,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-10 00:12:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2024-11-10 00:12:23,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797156849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:12:23,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:12:23,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 9] total 39 [2024-11-10 00:12:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833315104] [2024-11-10 00:12:23,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:12:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 00:12:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:12:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 00:12:23,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1337, Unknown=3, NotChecked=0, Total=1482 [2024-11-10 00:12:23,740 INFO L87 Difference]: Start difference. First operand 772 states and 1146 transitions. Second operand has 39 states, 36 states have (on average 4.777777777777778) internal successors, (172), 35 states have internal predecessors, (172), 18 states have call successors, (70), 13 states have call predecessors, (70), 14 states have return successors, (70), 16 states have call predecessors, (70), 18 states have call successors, (70) [2024-11-10 00:12:25,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []