./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.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 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:39:01,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:39:01,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:39:01,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:39:01,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:39:01,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:39:01,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:39:01,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:39:01,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:39:01,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:39:01,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:39:01,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:39:01,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:39:01,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:39:01,981 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:39:01,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:39:01,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:39:01,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:39:01,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:39:01,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:39:01,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:39:01,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:39:01,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:39:01,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:39:01,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:39:01,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:39:01,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:39:01,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:39:01,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:39:01,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:39:01,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:39:01,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:39:01,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:01,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:39:01,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:39:01,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:39:01,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:39:01,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:39:01,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:39:01,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:39:01,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:39:01,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:39:01,989 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 -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2024-10-12 20:39:02,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:39:02,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:39:02,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:39:02,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:39:02,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:39:02,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2024-10-12 20:39:03,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:39:03,833 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:39:03,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2024-10-12 20:39:03,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70748c69f/c52c935119f14c669e6bdc087948d651/FLAG5120285b7 [2024-10-12 20:39:03,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70748c69f/c52c935119f14c669e6bdc087948d651 [2024-10-12 20:39:03,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:39:03,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:39:03,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:03,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:39:03,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:39:03,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:03" (1/1) ... [2024-10-12 20:39:03,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efebbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:03, skipping insertion in model container [2024-10-12 20:39:03,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:39:03" (1/1) ... [2024-10-12 20:39:03,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:39:04,280 WARN L248 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_stack-2.i[34556,34569] [2024-10-12 20:39:04,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:04,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:39:04,433 WARN L248 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_stack-2.i[34556,34569] [2024-10-12 20:39:04,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:39:04,574 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:39:04,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04 WrapperNode [2024-10-12 20:39:04,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:39:04,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:04,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:39:04,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:39:04,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,655 INFO L138 Inliner]: procedures = 252, calls = 268, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 605 [2024-10-12 20:39:04,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:39:04,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:39:04,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:39:04,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:39:04,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,704 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 8, 2, 8, 8, 20, 12, 13, 10, 6, 4, 11, 6, 0, 6, 2, 4]. 16 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [0, 2, 2, 3, 3, 6, 6, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0]. The 33 writes are split as follows [0, 3, 0, 2, 2, 8, 3, 7, 3, 2, 0, 1, 0, 0, 0, 0, 2]. [2024-10-12 20:39:04,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:39:04,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:39:04,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:39:04,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:39:04,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (1/1) ... [2024-10-12 20:39:04,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:39:04,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:04,796 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-10-12 20:39:04,800 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-10-12 20:39:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 20:39:04,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 20:39:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 20:39:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:04,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-12 20:39:04,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 20:39:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-12 20:39:04,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-12 20:39:04,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 20:39:04,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-12 20:39:04,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:04,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 20:39:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 20:39:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-12 20:39:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-12 20:39:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-12 20:39:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-12 20:39:04,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-12 20:39:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 20:39:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 20:39:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 20:39:04,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-12 20:39:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2024-10-12 20:39:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 20:39:04,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-12 20:39:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-12 20:39:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-12 20:39:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-12 20:39:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-12 20:39:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-12 20:39:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-12 20:39:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-12 20:39:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-12 20:39:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-12 20:39:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-12 20:39:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:39:04,850 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-12 20:39:04,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 20:39:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 20:39:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 20:39:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 20:39:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 20:39:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:39:04,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:39:05,061 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:39:05,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:39:05,106 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,106 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-10-12 20:39:05,465 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,465 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-4: SUMMARY for call __CS_cs(); srcloc: null [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2024-10-12 20:39:05,466 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,475 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,475 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,475 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,475 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,476 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,476 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,476 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-12 20:39:05,476 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2024-10-12 20:39:05,476 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: SUMMARY for call __CS_cs(); srcloc: null [2024-10-12 20:39:05,781 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-10-12 20:39:05,782 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:39:05,824 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:39:05,826 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 20:39:05,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:05 BoogieIcfgContainer [2024-10-12 20:39:05,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:39:05,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:39:05,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:39:05,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:39:05,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:39:03" (1/3) ... [2024-10-12 20:39:05,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b0c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:05, skipping insertion in model container [2024-10-12 20:39:05,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:39:04" (2/3) ... [2024-10-12 20:39:05,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b0c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:39:05, skipping insertion in model container [2024-10-12 20:39:05,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:39:05" (3/3) ... [2024-10-12 20:39:05,834 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2024-10-12 20:39:05,847 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:39:05,847 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:39:05,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:39:05,898 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;@4eefdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:39:05,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:39:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 124 states have (on average 1.5564516129032258) internal successors, (193), 127 states have internal predecessors, (193), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-12 20:39:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:39:05,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:05,920 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:39:05,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 824001777, now seen corresponding path program 1 times [2024-10-12 20:39:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238446216] [2024-10-12 20:39:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 20:39:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:39:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:39:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:39:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:39:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 20:39:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 20:39:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:39:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 20:39:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 20:39:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:06,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238446216] [2024-10-12 20:39:06,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238446216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:06,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:06,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:39:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510930353] [2024-10-12 20:39:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:06,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:39:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:39:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:39:06,483 INFO L87 Difference]: Start difference. First operand has 210 states, 124 states have (on average 1.5564516129032258) internal successors, (193), 127 states have internal predecessors, (193), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 20:39:08,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:08,229 INFO L93 Difference]: Finished difference Result 417 states and 750 transitions. [2024-10-12 20:39:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:39:08,231 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-10-12 20:39:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:08,243 INFO L225 Difference]: With dead ends: 417 [2024-10-12 20:39:08,243 INFO L226 Difference]: Without dead ends: 208 [2024-10-12 20:39:08,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-12 20:39:08,253 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:08,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:39:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-12 20:39:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-10-12 20:39:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 123 states have (on average 1.5203252032520325) internal successors, (187), 125 states have internal predecessors, (187), 75 states have call successors, (75), 9 states have call predecessors, (75), 9 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-12 20:39:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 337 transitions. [2024-10-12 20:39:08,314 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 337 transitions. Word has length 93 [2024-10-12 20:39:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:08,314 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 337 transitions. [2024-10-12 20:39:08,314 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), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 20:39:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 337 transitions. [2024-10-12 20:39:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:39:08,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:08,320 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:39:08,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:39:08,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:08,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash 209520341, now seen corresponding path program 1 times [2024-10-12 20:39:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555071507] [2024-10-12 20:39:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 20:39:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 20:39:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:39:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:39:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:39:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 20:39:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 20:39:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 20:39:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 20:39:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 20:39:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 20:39:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 20:39:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:39:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 20:39:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-12 20:39:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555071507] [2024-10-12 20:39:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555071507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:39:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110599058] [2024-10-12 20:39:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:39:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:39:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:39:08,860 INFO L87 Difference]: Start difference. First operand 208 states and 337 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:10,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:12,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:12,566 INFO L93 Difference]: Finished difference Result 413 states and 678 transitions. [2024-10-12 20:39:12,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:39:12,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-12 20:39:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:12,572 INFO L225 Difference]: With dead ends: 413 [2024-10-12 20:39:12,572 INFO L226 Difference]: Without dead ends: 379 [2024-10-12 20:39:12,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:39:12,574 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 297 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:12,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1026 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 20:39:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-12 20:39:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-10-12 20:39:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 229 states have internal predecessors, (350), 135 states have call successors, (135), 18 states have call predecessors, (135), 18 states have return successors, (143), 135 states have call predecessors, (143), 135 states have call successors, (143) [2024-10-12 20:39:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 628 transitions. [2024-10-12 20:39:12,607 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 628 transitions. Word has length 93 [2024-10-12 20:39:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 628 transitions. [2024-10-12 20:39:12,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 20:39:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 628 transitions. [2024-10-12 20:39:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 20:39:12,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:12,614 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:39:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:39:12,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:12,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1407400477, now seen corresponding path program 1 times [2024-10-12 20:39:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032068434] [2024-10-12 20:39:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 20:39:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 20:39:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:39:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 20:39:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:39:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:39:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2024-10-12 20:39:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032068434] [2024-10-12 20:39:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032068434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:13,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968947018] [2024-10-12 20:39:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:13,412 INFO L87 Difference]: Start difference. First operand 379 states and 628 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:16,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:17,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:19,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:21,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:22,531 INFO L93 Difference]: Finished difference Result 821 states and 1358 transitions. [2024-10-12 20:39:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:39:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 166 [2024-10-12 20:39:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:22,545 INFO L225 Difference]: With dead ends: 821 [2024-10-12 20:39:22,545 INFO L226 Difference]: Without dead ends: 783 [2024-10-12 20:39:22,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:39:22,547 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 495 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:22,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1033 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-10-12 20:39:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-12 20:39:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 765. [2024-10-12 20:39:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 452 states have (on average 1.5508849557522124) internal successors, (701), 467 states have internal predecessors, (701), 269 states have call successors, (269), 36 states have call predecessors, (269), 43 states have return successors, (309), 269 states have call predecessors, (309), 269 states have call successors, (309) [2024-10-12 20:39:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1279 transitions. [2024-10-12 20:39:22,691 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1279 transitions. Word has length 166 [2024-10-12 20:39:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:22,694 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1279 transitions. [2024-10-12 20:39:22,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1279 transitions. [2024-10-12 20:39:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 20:39:22,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:22,705 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:39:22,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:39:22,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 763148039, now seen corresponding path program 1 times [2024-10-12 20:39:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101399334] [2024-10-12 20:39:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 20:39:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 20:39:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:39:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 20:39:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:39:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:39:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2024-10-12 20:39:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101399334] [2024-10-12 20:39:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101399334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434020266] [2024-10-12 20:39:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:23,311 INFO L87 Difference]: Start difference. First operand 765 states and 1279 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:25,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:27,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:29,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:30,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:32,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:34,162 INFO L93 Difference]: Finished difference Result 1525 states and 2531 transitions. [2024-10-12 20:39:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:39:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 166 [2024-10-12 20:39:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:34,168 INFO L225 Difference]: With dead ends: 1525 [2024-10-12 20:39:34,168 INFO L226 Difference]: Without dead ends: 764 [2024-10-12 20:39:34,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:39:34,173 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 459 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:34,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1138 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-10-12 20:39:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-10-12 20:39:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 748. [2024-10-12 20:39:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 443 states have (on average 1.5440180586907448) internal successors, (684), 458 states have internal predecessors, (684), 261 states have call successors, (261), 35 states have call predecessors, (261), 43 states have return successors, (294), 262 states have call predecessors, (294), 261 states have call successors, (294) [2024-10-12 20:39:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1239 transitions. [2024-10-12 20:39:34,242 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1239 transitions. Word has length 166 [2024-10-12 20:39:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1239 transitions. [2024-10-12 20:39:34,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1239 transitions. [2024-10-12 20:39:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 20:39:34,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:34,248 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:39:34,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:39:34,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:34,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1641883697, now seen corresponding path program 1 times [2024-10-12 20:39:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741362415] [2024-10-12 20:39:34,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:34,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:39:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 20:39:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:39:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 20:39:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 20:39:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 20:39:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 20:39:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 20:39:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 20:39:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:39:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 20:39:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 20:39:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 20:39:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 20:39:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 20:39:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 20:39:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 20:39:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 20:39:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 20:39:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 20:39:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:39:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:39:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2024-10-12 20:39:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741362415] [2024-10-12 20:39:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741362415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:39:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:39:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:39:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387928124] [2024-10-12 20:39:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:39:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:39:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:39:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:39:34,942 INFO L87 Difference]: Start difference. First operand 748 states and 1239 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:37,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:38,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:40,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:43,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:39:44,791 INFO L93 Difference]: Finished difference Result 1205 states and 1958 transitions. [2024-10-12 20:39:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:39:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 166 [2024-10-12 20:39:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:39:44,796 INFO L225 Difference]: With dead ends: 1205 [2024-10-12 20:39:44,796 INFO L226 Difference]: Without dead ends: 674 [2024-10-12 20:39:44,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:39:44,798 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 514 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:39:44,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1089 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-10-12 20:39:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-10-12 20:39:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2024-10-12 20:39:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 390 states have (on average 1.5153846153846153) internal successors, (591), 403 states have internal predecessors, (591), 220 states have call successors, (220), 35 states have call predecessors, (220), 43 states have return successors, (250), 221 states have call predecessors, (250), 220 states have call successors, (250) [2024-10-12 20:39:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1061 transitions. [2024-10-12 20:39:44,834 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1061 transitions. Word has length 166 [2024-10-12 20:39:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:39:44,835 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1061 transitions. [2024-10-12 20:39:44,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-12 20:39:44,835 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1061 transitions. [2024-10-12 20:39:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:39:44,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:39:44,839 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 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] [2024-10-12 20:39:44,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:39:44,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:39:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:39:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -165281620, now seen corresponding path program 1 times [2024-10-12 20:39:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:39:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245744985] [2024-10-12 20:39:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:39:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:39:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:39:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:39:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:39:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:39:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:39:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:39:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:39:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:39:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:39:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 20:39:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:39:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 20:39:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:39:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 20:39:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 20:39:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 20:39:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:39:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:39:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-12 20:39:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 20:39:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 20:39:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 20:39:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 20:39:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2024-10-12 20:39:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:39:45,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245744985] [2024-10-12 20:39:45,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245744985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:39:45,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792507745] [2024-10-12 20:39:45,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:39:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:39:45,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:39:45,870 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-10-12 20:39:45,873 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-10-12 20:39:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:39:46,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 20:39:46,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:39:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-10-12 20:39:46,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:39:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2024-10-12 20:39:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792507745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:39:46,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:39:46,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-12 20:39:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901542767] [2024-10-12 20:39:46,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:39:46,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 20:39:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:39:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 20:39:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:39:46,673 INFO L87 Difference]: Start difference. First operand 654 states and 1061 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 12 states have internal predecessors, (80), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-10-12 20:39:49,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:50,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:52,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:54,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:56,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:58,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:39:59,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-12 20:40:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:40:03,561 INFO L93 Difference]: Finished difference Result 1698 states and 2761 transitions. [2024-10-12 20:40:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 20:40:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 12 states have internal predecessors, (80), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 169 [2024-10-12 20:40:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:40:03,569 INFO L225 Difference]: With dead ends: 1698 [2024-10-12 20:40:03,571 INFO L226 Difference]: Without dead ends: 1047 [2024-10-12 20:40:03,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-12 20:40:03,575 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1328 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 1290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1290 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:40:03,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 1703 Invalid, 3511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1290 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2024-10-12 20:40:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-12 20:40:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1014. [2024-10-12 20:40:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 602 states have (on average 1.5099667774086378) internal successors, (909), 622 states have internal predecessors, (909), 345 states have call successors, (345), 57 states have call predecessors, (345), 66 states have return successors, (392), 344 states have call predecessors, (392), 345 states have call successors, (392) [2024-10-12 20:40:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1646 transitions. [2024-10-12 20:40:03,655 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1646 transitions. Word has length 169 [2024-10-12 20:40:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:40:03,655 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1646 transitions. [2024-10-12 20:40:03,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 12 states have internal predecessors, (80), 9 states have call successors, (51), 8 states have call predecessors, (51), 7 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2024-10-12 20:40:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1646 transitions. [2024-10-12 20:40:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:40:03,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:40:03,662 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 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] [2024-10-12 20:40:03,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:40:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 20:40:03,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:40:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:40:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1497158122, now seen corresponding path program 1 times [2024-10-12 20:40:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:40:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397208032] [2024-10-12 20:40:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:40:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:40:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:40:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:40:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:40:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 20:40:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 20:40:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 20:40:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 20:40:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 20:40:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 20:40:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 20:40:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 20:40:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 20:40:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 20:40:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 20:40:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 20:40:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 20:40:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:40:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 20:40:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-12 20:40:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 20:40:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 20:40:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 20:40:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-12 20:40:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2024-10-12 20:40:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:40:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397208032] [2024-10-12 20:40:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397208032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:40:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516388506] [2024-10-12 20:40:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:40:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:40:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:40:06,401 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-10-12 20:40:06,402 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-10-12 20:40:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:40:06,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 20:40:06,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:40:06,994 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-10-12 20:40:09,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 20:40:09,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 20:40:09,436 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-10-12 20:40:10,248 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-12 20:40:10,248 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