./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:47:31,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:47:31,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 14:47:31,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:47:31,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:47:31,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:47:31,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:47:31,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:47:31,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:47:31,090 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:47:31,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:47:31,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:47:31,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:47:31,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:47:31,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:47:31,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:47:31,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:47:31,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 14:47:31,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:47:31,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 14:47:31,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:47:31,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:47:31,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:47:31,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:47:31,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:47:31,098 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:47:31,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:47:31,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 14:47:31,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:47:31,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:47:31,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:47:31,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:47:31,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:47:31,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:47:31,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:47:31,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:47:31,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:47:31,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:47:31,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:47:31,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:47:31,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:47:31,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:47:31,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:47:31,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:47:31,105 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 ! overflow) ) 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-09 14:47:31,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:47:31,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:47:31,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:47:31,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:47:31,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:47:31,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-09 14:47:32,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:47:32,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:47:32,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-09 14:47:32,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09254e09/64e0246efbd2495a8292fabf8ab839a1/FLAG348c49727 [2024-11-09 14:47:33,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09254e09/64e0246efbd2495a8292fabf8ab839a1 [2024-11-09 14:47:33,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:47:33,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:47:33,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:47:33,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:47:33,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:47:33,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:33,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3d7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33, skipping insertion in model container [2024-11-09 14:47:33,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:33,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:47:33,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:47:33,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:47:33,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:47:33,887 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:47:33,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33 WrapperNode [2024-11-09 14:47:33,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:47:33,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:47:33,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:47:33,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:47:33,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:33,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:33,995 INFO L138 Inliner]: procedures = 282, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1657 [2024-11-09 14:47:33,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:47:33,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:47:33,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:47:33,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:47:34,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,097 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-09 14:47:34,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:47:34,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:47:34,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:47:34,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:47:34,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (1/1) ... [2024-11-09 14:47:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:47:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:34,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:47:34,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:47:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 14:47:34,301 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 14:47:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 14:47:34,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:47:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:47:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:47:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:47:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:47:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-09 14:47:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-09 14:47:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:47:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:47:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 14:47:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 14:47:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 14:47:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 14:47:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:47:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:47:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:47:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 14:47:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-09 14:47:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:47:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-09 14:47:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-09 14:47:34,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:47:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:47:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:47:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 14:47:34,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:47:34,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:47:34,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:47:34,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:47:35,696 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2024-11-09 14:47:35,699 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:47:35,723 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:47:35,727 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-09 14:47:35,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:47:35 BoogieIcfgContainer [2024-11-09 14:47:35,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:47:35,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:47:35,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:47:35,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:47:35,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:47:33" (1/3) ... [2024-11-09 14:47:35,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3415a7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:47:35, skipping insertion in model container [2024-11-09 14:47:35,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:47:33" (2/3) ... [2024-11-09 14:47:35,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3415a7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:47:35, skipping insertion in model container [2024-11-09 14:47:35,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:47:35" (3/3) ... [2024-11-09 14:47:35,738 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-09 14:47:35,751 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:47:35,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 14:47:35,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:47:35,823 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;@536093ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:47:35,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 14:47:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 501 states, 462 states have (on average 1.606060606060606) internal successors, (742), 479 states have internal predecessors, (742), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 14:47:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:47:35,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:35,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:35,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:35,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1635847084, now seen corresponding path program 1 times [2024-11-09 14:47:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165603247] [2024-11-09 14:47:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165603247] [2024-11-09 14:47:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165603247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:47:36,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265327090] [2024-11-09 14:47:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:47:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:47:36,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:47:36,071 INFO L87 Difference]: Start difference. First operand has 501 states, 462 states have (on average 1.606060606060606) internal successors, (742), 479 states have internal predecessors, (742), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:36,138 INFO L93 Difference]: Finished difference Result 995 states and 1569 transitions. [2024-11-09 14:47:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:47:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 14:47:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:36,150 INFO L225 Difference]: With dead ends: 995 [2024-11-09 14:47:36,150 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 14:47:36,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:47:36,156 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:36,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:47:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 14:47:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-11-09 14:47:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 454 states have (on average 1.4383259911894273) internal successors, (653), 468 states have internal predecessors, (653), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 14:47:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 683 transitions. [2024-11-09 14:47:36,208 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 683 transitions. Word has length 8 [2024-11-09 14:47:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:36,208 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 683 transitions. [2024-11-09 14:47:36,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 683 transitions. [2024-11-09 14:47:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:47:36,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:36,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:36,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:47:36,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:36,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1635849006, now seen corresponding path program 1 times [2024-11-09 14:47:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520909559] [2024-11-09 14:47:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:47:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524949986] [2024-11-09 14:47:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:36,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:36,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:36,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 14:47:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:36,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:47:36,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:36,454 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 11 treesize of output 7 [2024-11-09 14:47:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:36,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:36,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520909559] [2024-11-09 14:47:36,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:47:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524949986] [2024-11-09 14:47:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524949986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:47:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409663259] [2024-11-09 14:47:36,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:36,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:47:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:36,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:47:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:47:36,490 INFO L87 Difference]: Start difference. First operand 487 states and 683 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:36,652 INFO L93 Difference]: Finished difference Result 940 states and 1333 transitions. [2024-11-09 14:47:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:47:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 14:47:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:36,658 INFO L225 Difference]: With dead ends: 940 [2024-11-09 14:47:36,658 INFO L226 Difference]: Without dead ends: 938 [2024-11-09 14:47:36,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:47:36,660 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 614 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:36,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1961 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-09 14:47:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 494. [2024-11-09 14:47:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4338394793926248) internal successors, (661), 475 states have internal predecessors, (661), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 14:47:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 691 transitions. [2024-11-09 14:47:36,697 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 691 transitions. Word has length 8 [2024-11-09 14:47:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 691 transitions. [2024-11-09 14:47:36,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 691 transitions. [2024-11-09 14:47:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 14:47:36,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:36,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:36,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 14:47:36,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:36,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:36,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1086501261, now seen corresponding path program 1 times [2024-11-09 14:47:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:36,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967488244] [2024-11-09 14:47:36,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:36,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 14:47:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:47:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 14:47:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 14:47:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967488244] [2024-11-09 14:47:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967488244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:47:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698389278] [2024-11-09 14:47:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:47:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:47:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:47:37,097 INFO L87 Difference]: Start difference. First operand 494 states and 691 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 14:47:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:37,232 INFO L93 Difference]: Finished difference Result 1192 states and 1688 transitions. [2024-11-09 14:47:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:47:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-09 14:47:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:37,237 INFO L225 Difference]: With dead ends: 1192 [2024-11-09 14:47:37,238 INFO L226 Difference]: Without dead ends: 937 [2024-11-09 14:47:37,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:47:37,240 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 616 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:37,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2000 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-09 14:47:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 494. [2024-11-09 14:47:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4316702819956617) internal successors, (660), 475 states have internal predecessors, (660), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 14:47:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 690 transitions. [2024-11-09 14:47:37,257 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 690 transitions. Word has length 34 [2024-11-09 14:47:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:37,257 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 690 transitions. [2024-11-09 14:47:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 14:47:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 690 transitions. [2024-11-09 14:47:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:47:37,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:37,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:47:37,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:37,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 185612591, now seen corresponding path program 1 times [2024-11-09 14:47:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151091818] [2024-11-09 14:47:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151091818] [2024-11-09 14:47:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151091818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:37,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:37,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:47:37,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562507179] [2024-11-09 14:47:37,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:37,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:47:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:47:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:47:37,477 INFO L87 Difference]: Start difference. First operand 494 states and 690 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:37,647 INFO L93 Difference]: Finished difference Result 982 states and 1374 transitions. [2024-11-09 14:47:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:47:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 14:47:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:37,649 INFO L225 Difference]: With dead ends: 982 [2024-11-09 14:47:37,649 INFO L226 Difference]: Without dead ends: 497 [2024-11-09 14:47:37,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:47:37,651 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 105 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:37,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1872 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-09 14:47:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 494. [2024-11-09 14:47:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4164859002169197) internal successors, (653), 475 states have internal predecessors, (653), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 14:47:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 683 transitions. [2024-11-09 14:47:37,667 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 683 transitions. Word has length 64 [2024-11-09 14:47:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:37,668 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 683 transitions. [2024-11-09 14:47:37,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 683 transitions. [2024-11-09 14:47:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:47:37,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:37,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:47:37,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -878587357, now seen corresponding path program 1 times [2024-11-09 14:47:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659401128] [2024-11-09 14:47:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:37,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659401128] [2024-11-09 14:47:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659401128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:47:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910714730] [2024-11-09 14:47:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:47:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:47:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:47:37,890 INFO L87 Difference]: Start difference. First operand 494 states and 683 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:37,933 INFO L93 Difference]: Finished difference Result 909 states and 1268 transitions. [2024-11-09 14:47:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:47:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 14:47:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:37,938 INFO L225 Difference]: With dead ends: 909 [2024-11-09 14:47:37,939 INFO L226 Difference]: Without dead ends: 905 [2024-11-09 14:47:37,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:47:37,940 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 516 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:37,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2008 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:47:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-09 14:47:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 897. [2024-11-09 14:47:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 856 states have (on average 1.425233644859813) internal successors, (1220), 872 states have internal predecessors, (1220), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 14:47:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1264 transitions. [2024-11-09 14:47:37,962 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1264 transitions. Word has length 64 [2024-11-09 14:47:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:37,963 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1264 transitions. [2024-11-09 14:47:37,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1264 transitions. [2024-11-09 14:47:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 14:47:37,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:37,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:37,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 14:47:37,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -240672312, now seen corresponding path program 1 times [2024-11-09 14:47:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:37,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235964187] [2024-11-09 14:47:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:38,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235964187] [2024-11-09 14:47:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235964187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:47:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278569945] [2024-11-09 14:47:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:38,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:47:38,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:47:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:47:38,135 INFO L87 Difference]: Start difference. First operand 897 states and 1264 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:47:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:38,275 INFO L93 Difference]: Finished difference Result 1171 states and 1640 transitions. [2024-11-09 14:47:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:47:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-09 14:47:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:38,280 INFO L225 Difference]: With dead ends: 1171 [2024-11-09 14:47:38,280 INFO L226 Difference]: Without dead ends: 1169 [2024-11-09 14:47:38,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:47:38,283 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 572 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:38,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1923 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-11-09 14:47:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1159. [2024-11-09 14:47:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1105 states have (on average 1.4244343891402715) internal successors, (1574), 1122 states have internal predecessors, (1574), 32 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 14:47:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1638 transitions. [2024-11-09 14:47:38,332 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1638 transitions. Word has length 74 [2024-11-09 14:47:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:38,334 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1638 transitions. [2024-11-09 14:47:38,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 14:47:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1638 transitions. [2024-11-09 14:47:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 14:47:38,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:38,335 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 14:47:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 14:47:38,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:38,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 980932139, now seen corresponding path program 1 times [2024-11-09 14:47:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165214589] [2024-11-09 14:47:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165214589] [2024-11-09 14:47:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165214589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:38,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563060000] [2024-11-09 14:47:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:38,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:38,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 14:47:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:38,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:47:38,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:38,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563060000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:47:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-09 14:47:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756044207] [2024-11-09 14:47:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:38,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:47:38,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:38,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:47:38,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:47:38,971 INFO L87 Difference]: Start difference. First operand 1159 states and 1638 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 14:47:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:39,051 INFO L93 Difference]: Finished difference Result 1576 states and 2224 transitions. [2024-11-09 14:47:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:47:39,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-09 14:47:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:39,059 INFO L225 Difference]: With dead ends: 1576 [2024-11-09 14:47:39,059 INFO L226 Difference]: Without dead ends: 1575 [2024-11-09 14:47:39,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:47:39,061 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 636 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:39,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 2589 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:47:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-09 14:47:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1525. [2024-11-09 14:47:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1464 states have (on average 1.4296448087431695) internal successors, (2093), 1483 states have internal predecessors, (2093), 37 states have call successors, (37), 13 states have call predecessors, (37), 10 states have return successors, (37), 30 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 14:47:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2167 transitions. [2024-11-09 14:47:39,106 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2167 transitions. Word has length 83 [2024-11-09 14:47:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2167 transitions. [2024-11-09 14:47:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 14:47:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2167 transitions. [2024-11-09 14:47:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 14:47:39,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:39,110 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 14:47:39,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 14:47:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 14:47:39,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:39,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 344125278, now seen corresponding path program 1 times [2024-11-09 14:47:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995443518] [2024-11-09 14:47:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995443518] [2024-11-09 14:47:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995443518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589050424] [2024-11-09 14:47:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:39,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 14:47:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:39,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 14:47:39,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:39,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:47:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589050424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:47:40,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:47:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-11-09 14:47:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439588428] [2024-11-09 14:47:40,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:47:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 14:47:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 14:47:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-09 14:47:40,213 INFO L87 Difference]: Start difference. First operand 1525 states and 2167 transitions. Second operand has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 14:47:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:41,698 INFO L93 Difference]: Finished difference Result 4158 states and 5901 transitions. [2024-11-09 14:47:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 14:47:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 84 [2024-11-09 14:47:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:41,711 INFO L225 Difference]: With dead ends: 4158 [2024-11-09 14:47:41,711 INFO L226 Difference]: Without dead ends: 4156 [2024-11-09 14:47:41,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=1350, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 14:47:41,713 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 5941 mSDsluCounter, 11594 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5966 SdHoareTripleChecker+Valid, 12314 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:41,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5966 Valid, 12314 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 14:47:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2024-11-09 14:47:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 3179. [2024-11-09 14:47:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3059 states have (on average 1.4233409610983982) internal successors, (4354), 3080 states have internal predecessors, (4354), 83 states have call successors, (83), 28 states have call predecessors, (83), 23 states have return successors, (106), 70 states have call predecessors, (106), 83 states have call successors, (106) [2024-11-09 14:47:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4543 transitions. [2024-11-09 14:47:41,779 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4543 transitions. Word has length 84 [2024-11-09 14:47:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 3179 states and 4543 transitions. [2024-11-09 14:47:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 14:47:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4543 transitions. [2024-11-09 14:47:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 14:47:41,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:41,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:41,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 14:47:41,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:41,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1558756002, now seen corresponding path program 1 times [2024-11-09 14:47:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418965765] [2024-11-09 14:47:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418965765] [2024-11-09 14:47:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418965765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:42,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:47:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519167805] [2024-11-09 14:47:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:42,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:47:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:47:42,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:47:42,071 INFO L87 Difference]: Start difference. First operand 3179 states and 4543 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:42,234 INFO L93 Difference]: Finished difference Result 6616 states and 9488 transitions. [2024-11-09 14:47:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:47:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-09 14:47:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:42,244 INFO L225 Difference]: With dead ends: 6616 [2024-11-09 14:47:42,244 INFO L226 Difference]: Without dead ends: 3446 [2024-11-09 14:47:42,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:47:42,249 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 420 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:42,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1545 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2024-11-09 14:47:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3332. [2024-11-09 14:47:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3218 states have (on average 1.4334990677439403) internal successors, (4613), 3238 states have internal predecessors, (4613), 80 states have call successors, (80), 24 states have call predecessors, (80), 20 states have return successors, (102), 69 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-09 14:47:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4795 transitions. [2024-11-09 14:47:42,313 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4795 transitions. Word has length 82 [2024-11-09 14:47:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:42,314 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4795 transitions. [2024-11-09 14:47:42,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:47:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4795 transitions. [2024-11-09 14:47:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 14:47:42,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:42,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:42,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 14:47:42,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1908045712, now seen corresponding path program 1 times [2024-11-09 14:47:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924062442] [2024-11-09 14:47:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:47:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 14:47:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924062442] [2024-11-09 14:47:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924062442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443910252] [2024-11-09 14:47:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:42,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:42,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 14:47:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:42,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 14:47:42,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:42,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:47:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 14:47:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443910252] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:43,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:47:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 13 [2024-11-09 14:47:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049709355] [2024-11-09 14:47:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:43,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:47:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:47:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:47:43,121 INFO L87 Difference]: Start difference. First operand 3332 states and 4795 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:47:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:43,223 INFO L93 Difference]: Finished difference Result 3332 states and 4795 transitions. [2024-11-09 14:47:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:47:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 93 [2024-11-09 14:47:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:43,232 INFO L225 Difference]: With dead ends: 3332 [2024-11-09 14:47:43,232 INFO L226 Difference]: Without dead ends: 3331 [2024-11-09 14:47:43,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:47:43,234 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 1816 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:43,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 671 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:47:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2024-11-09 14:47:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2024-11-09 14:47:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3218 states have (on average 1.4319453076444997) internal successors, (4608), 3237 states have internal predecessors, (4608), 80 states have call successors, (80), 24 states have call predecessors, (80), 20 states have return successors, (102), 69 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-09 14:47:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4790 transitions. [2024-11-09 14:47:43,299 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4790 transitions. Word has length 93 [2024-11-09 14:47:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 4790 transitions. [2024-11-09 14:47:43,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 14:47:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4790 transitions. [2024-11-09 14:47:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 14:47:43,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:43,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:43,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:43,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:43,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 980125141, now seen corresponding path program 1 times [2024-11-09 14:47:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864008571] [2024-11-09 14:47:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:47:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 14:47:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864008571] [2024-11-09 14:47:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864008571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180067376] [2024-11-09 14:47:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:43,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:43,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 14:47:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:44,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 14:47:44,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:44,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:47:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 14:47:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180067376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:47:44,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:47:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 13 [2024-11-09 14:47:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712651741] [2024-11-09 14:47:44,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:47:44,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 14:47:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 14:47:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:47:44,379 INFO L87 Difference]: Start difference. First operand 3331 states and 4790 transitions. Second operand has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 14:47:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:45,038 INFO L93 Difference]: Finished difference Result 6509 states and 9324 transitions. [2024-11-09 14:47:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 14:47:45,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 94 [2024-11-09 14:47:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:45,055 INFO L225 Difference]: With dead ends: 6509 [2024-11-09 14:47:45,055 INFO L226 Difference]: Without dead ends: 6508 [2024-11-09 14:47:45,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2024-11-09 14:47:45,057 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 2496 mSDsluCounter, 4912 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 5546 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:45,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 5546 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 14:47:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2024-11-09 14:47:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6070. [2024-11-09 14:47:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6070 states, 5848 states have (on average 1.427325581395349) internal successors, (8347), 5872 states have internal predecessors, (8347), 159 states have call successors, (159), 56 states have call predecessors, (159), 50 states have return successors, (197), 141 states have call predecessors, (197), 159 states have call successors, (197) [2024-11-09 14:47:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 8703 transitions. [2024-11-09 14:47:45,207 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 8703 transitions. Word has length 94 [2024-11-09 14:47:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:45,207 INFO L471 AbstractCegarLoop]: Abstraction has 6070 states and 8703 transitions. [2024-11-09 14:47:45,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 14:47:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8703 transitions. [2024-11-09 14:47:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 14:47:45,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:45,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:45,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:45,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 14:47:45,410 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:45,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2083756214, now seen corresponding path program 1 times [2024-11-09 14:47:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:45,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181703036] [2024-11-09 14:47:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:45,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:45,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:47:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:47:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 14:47:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181703036] [2024-11-09 14:47:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181703036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:45,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:47:45,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:47:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566089986] [2024-11-09 14:47:45,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:45,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:47:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:47:45,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:47:45,661 INFO L87 Difference]: Start difference. First operand 6070 states and 8703 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 14:47:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:46,170 INFO L93 Difference]: Finished difference Result 8326 states and 11950 transitions. [2024-11-09 14:47:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 14:47:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-09 14:47:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:46,190 INFO L225 Difference]: With dead ends: 8326 [2024-11-09 14:47:46,190 INFO L226 Difference]: Without dead ends: 8324 [2024-11-09 14:47:46,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:47:46,192 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 564 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:46,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 2917 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 14:47:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2024-11-09 14:47:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 6238. [2024-11-09 14:47:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6238 states, 6007 states have (on average 1.4225070750790745) internal successors, (8545), 6032 states have internal predecessors, (8545), 168 states have call successors, (168), 56 states have call predecessors, (168), 50 states have return successors, (209), 149 states have call predecessors, (209), 168 states have call successors, (209) [2024-11-09 14:47:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 8922 transitions. [2024-11-09 14:47:46,324 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 8922 transitions. Word has length 120 [2024-11-09 14:47:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:46,324 INFO L471 AbstractCegarLoop]: Abstraction has 6238 states and 8922 transitions. [2024-11-09 14:47:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 14:47:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 8922 transitions. [2024-11-09 14:47:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 14:47:46,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:46,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:46,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 14:47:46,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1429916002, now seen corresponding path program 1 times [2024-11-09 14:47:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849777938] [2024-11-09 14:47:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:47:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:47:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:47:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 14:47:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849777938] [2024-11-09 14:47:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849777938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085513910] [2024-11-09 14:47:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:46,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:46,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:46,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 14:47:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:46,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 14:47:46,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 14:47:47,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085513910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:47,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:47:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-09 14:47:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970592284] [2024-11-09 14:47:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:47,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:47:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:47:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:47:47,077 INFO L87 Difference]: Start difference. First operand 6238 states and 8922 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 14:47:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:47,265 INFO L93 Difference]: Finished difference Result 11822 states and 16948 transitions. [2024-11-09 14:47:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 14:47:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-11-09 14:47:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:47,276 INFO L225 Difference]: With dead ends: 11822 [2024-11-09 14:47:47,276 INFO L226 Difference]: Without dead ends: 5988 [2024-11-09 14:47:47,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-09 14:47:47,284 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 161 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:47,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 3174 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2024-11-09 14:47:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 5988. [2024-11-09 14:47:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5988 states, 5774 states have (on average 1.4255282299965362) internal successors, (8231), 5797 states have internal predecessors, (8231), 157 states have call successors, (157), 50 states have call predecessors, (157), 44 states have return successors, (192), 140 states have call predecessors, (192), 157 states have call successors, (192) [2024-11-09 14:47:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5988 states to 5988 states and 8580 transitions. [2024-11-09 14:47:47,461 INFO L78 Accepts]: Start accepts. Automaton has 5988 states and 8580 transitions. Word has length 127 [2024-11-09 14:47:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 5988 states and 8580 transitions. [2024-11-09 14:47:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 14:47:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5988 states and 8580 transitions. [2024-11-09 14:47:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 14:47:47,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:47,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:47,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:47,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:47,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2038802715, now seen corresponding path program 1 times [2024-11-09 14:47:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030127609] [2024-11-09 14:47:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:47:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:47:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 14:47:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 14:47:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 14:47:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 14:47:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030127609] [2024-11-09 14:47:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030127609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015992583] [2024-11-09 14:47:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:48,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:48,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:48,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 14:47:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:48,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 14:47:48,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:48,476 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 11 treesize of output 7 [2024-11-09 14:47:48,491 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 11 treesize of output 7 [2024-11-09 14:47:48,504 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 14:47:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 14:47:49,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:49,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015992583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:47:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2024-11-09 14:47:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666468243] [2024-11-09 14:47:49,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:49,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 14:47:49,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 14:47:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:47:49,081 INFO L87 Difference]: Start difference. First operand 5988 states and 8580 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:47:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:50,726 INFO L93 Difference]: Finished difference Result 14022 states and 20117 transitions. [2024-11-09 14:47:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:47:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 132 [2024-11-09 14:47:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:50,742 INFO L225 Difference]: With dead ends: 14022 [2024-11-09 14:47:50,742 INFO L226 Difference]: Without dead ends: 8123 [2024-11-09 14:47:50,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-09 14:47:50,752 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 880 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:50,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 4237 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 14:47:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8123 states. [2024-11-09 14:47:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8123 to 6014. [2024-11-09 14:47:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6014 states, 5800 states have (on average 1.4244827586206896) internal successors, (8262), 5823 states have internal predecessors, (8262), 157 states have call successors, (157), 50 states have call predecessors, (157), 44 states have return successors, (192), 140 states have call predecessors, (192), 157 states have call successors, (192) [2024-11-09 14:47:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6014 states to 6014 states and 8611 transitions. [2024-11-09 14:47:50,941 INFO L78 Accepts]: Start accepts. Automaton has 6014 states and 8611 transitions. Word has length 132 [2024-11-09 14:47:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:50,942 INFO L471 AbstractCegarLoop]: Abstraction has 6014 states and 8611 transitions. [2024-11-09 14:47:50,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:47:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6014 states and 8611 transitions. [2024-11-09 14:47:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 14:47:50,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:50,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:50,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 14:47:51,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:51,144 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 263134314, now seen corresponding path program 1 times [2024-11-09 14:47:51,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:51,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429034115] [2024-11-09 14:47:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:47:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:47:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:47:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 14:47:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 14:47:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 14:47:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429034115] [2024-11-09 14:47:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429034115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499640722] [2024-11-09 14:47:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:51,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:51,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 14:47:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:51,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 14:47:51,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:47:51,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499640722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:47:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2024-11-09 14:47:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606439149] [2024-11-09 14:47:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 14:47:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 14:47:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:47:51,928 INFO L87 Difference]: Start difference. First operand 6014 states and 8611 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 14:47:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:52,150 INFO L93 Difference]: Finished difference Result 9134 states and 13038 transitions. [2024-11-09 14:47:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:47:52,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 133 [2024-11-09 14:47:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:52,158 INFO L225 Difference]: With dead ends: 9134 [2024-11-09 14:47:52,158 INFO L226 Difference]: Without dead ends: 3273 [2024-11-09 14:47:52,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 14:47:52,175 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 13 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:52,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5266 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:47:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-09 14:47:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3271. [2024-11-09 14:47:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 3133 states have (on average 1.4127034790935207) internal successors, (4426), 3149 states have internal predecessors, (4426), 86 states have call successors, (86), 42 states have call predecessors, (86), 39 states have return successors, (97), 79 states have call predecessors, (97), 86 states have call successors, (97) [2024-11-09 14:47:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4609 transitions. [2024-11-09 14:47:52,292 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4609 transitions. Word has length 133 [2024-11-09 14:47:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:52,292 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4609 transitions. [2024-11-09 14:47:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 14:47:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4609 transitions. [2024-11-09 14:47:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 14:47:52,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:52,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:52,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 14:47:52,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 578798716, now seen corresponding path program 1 times [2024-11-09 14:47:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572782517] [2024-11-09 14:47:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:47:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:47:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:47:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 14:47:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:47:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 14:47:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572782517] [2024-11-09 14:47:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572782517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045932933] [2024-11-09 14:47:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:53,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:53,065 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 14:47:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:53,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 14:47:53,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 14:47:53,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:47:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 14:47:53,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045932933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:47:53,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:47:53,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 18 [2024-11-09 14:47:53,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390507083] [2024-11-09 14:47:53,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:47:53,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 14:47:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:53,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 14:47:53,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-09 14:47:53,754 INFO L87 Difference]: Start difference. First operand 3271 states and 4609 transitions. Second operand has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:47:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:54,781 INFO L93 Difference]: Finished difference Result 6452 states and 9113 transitions. [2024-11-09 14:47:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 14:47:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2024-11-09 14:47:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:54,789 INFO L225 Difference]: With dead ends: 6452 [2024-11-09 14:47:54,790 INFO L226 Difference]: Without dead ends: 3343 [2024-11-09 14:47:54,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 14:47:54,793 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 105 mSDsluCounter, 6162 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:54,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 6801 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 14:47:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2024-11-09 14:47:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3311. [2024-11-09 14:47:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3172 states have (on average 1.4126733921815888) internal successors, (4481), 3185 states have internal predecessors, (4481), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:47:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4660 transitions. [2024-11-09 14:47:54,870 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4660 transitions. Word has length 135 [2024-11-09 14:47:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 4660 transitions. [2024-11-09 14:47:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:47:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4660 transitions. [2024-11-09 14:47:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 14:47:54,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:54,872 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:54,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:55,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 14:47:55,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1627055286, now seen corresponding path program 2 times [2024-11-09 14:47:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539274347] [2024-11-09 14:47:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:47:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:47:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:47:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:47:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 14:47:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 14:47:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539274347] [2024-11-09 14:47:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539274347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194264368] [2024-11-09 14:47:55,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:47:55,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:55,685 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:55,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 14:47:55,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:47:55,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:47:55,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:47:55,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:55,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 14:47:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 14:47:55,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:47:55,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194264368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:47:55,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:47:55,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2024-11-09 14:47:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420595623] [2024-11-09 14:47:55,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:47:55,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:47:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:47:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:47:55,991 INFO L87 Difference]: Start difference. First operand 3311 states and 4660 transitions. Second operand has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:47:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:56,042 INFO L93 Difference]: Finished difference Result 3311 states and 4660 transitions. [2024-11-09 14:47:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:47:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 139 [2024-11-09 14:47:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:56,049 INFO L225 Difference]: With dead ends: 3311 [2024-11-09 14:47:56,049 INFO L226 Difference]: Without dead ends: 3310 [2024-11-09 14:47:56,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:47:56,050 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 1 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:56,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:47:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2024-11-09 14:47:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3310. [2024-11-09 14:47:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3172 states have (on average 1.41078184110971) internal successors, (4475), 3184 states have internal predecessors, (4475), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:47:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4654 transitions. [2024-11-09 14:47:56,163 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4654 transitions. Word has length 139 [2024-11-09 14:47:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:56,163 INFO L471 AbstractCegarLoop]: Abstraction has 3310 states and 4654 transitions. [2024-11-09 14:47:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:47:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4654 transitions. [2024-11-09 14:47:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 14:47:56,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:56,165 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:56,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 14:47:56,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1100893789, now seen corresponding path program 1 times [2024-11-09 14:47:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109610201] [2024-11-09 14:47:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:47:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:47:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:47:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:47:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 14:47:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 14:47:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:47:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109610201] [2024-11-09 14:47:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109610201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:47:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902060684] [2024-11-09 14:47:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:56,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:47:56,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:47:56,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:47:56,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 14:47:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:47:57,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 14:47:57,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:47:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 14:47:57,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:47:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 14:47:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902060684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:47:57,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:47:57,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 9] total 28 [2024-11-09 14:47:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551131901] [2024-11-09 14:47:57,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:47:57,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 14:47:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:47:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 14:47:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-11-09 14:47:57,715 INFO L87 Difference]: Start difference. First operand 3310 states and 4654 transitions. Second operand has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:47:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:47:59,430 INFO L93 Difference]: Finished difference Result 6329 states and 8878 transitions. [2024-11-09 14:47:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 14:47:59,430 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2024-11-09 14:47:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:47:59,436 INFO L225 Difference]: With dead ends: 6329 [2024-11-09 14:47:59,437 INFO L226 Difference]: Without dead ends: 3015 [2024-11-09 14:47:59,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=534, Invalid=2888, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 14:47:59,441 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 149 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 14:47:59,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 7427 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 14:47:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2024-11-09 14:47:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2993. [2024-11-09 14:47:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2855 states have (on average 1.386690017513135) internal successors, (3959), 2867 states have internal predecessors, (3959), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:47:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4138 transitions. [2024-11-09 14:47:59,509 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4138 transitions. Word has length 140 [2024-11-09 14:47:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:47:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 4138 transitions. [2024-11-09 14:47:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:47:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4138 transitions. [2024-11-09 14:47:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 14:47:59,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:47:59,511 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:47:59,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 14:47:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 14:47:59,715 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:47:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:47:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1902020724, now seen corresponding path program 2 times [2024-11-09 14:47:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:47:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978136339] [2024-11-09 14:47:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:47:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:47:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:48:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:48:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 14:48:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 14:48:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 14:48:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978136339] [2024-11-09 14:48:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978136339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:48:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555170132] [2024-11-09 14:48:00,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:48:00,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:00,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:48:00,529 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:48:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 14:48:01,477 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:48:01,477 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:48:01,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 14:48:01,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:48:01,495 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 11 treesize of output 7 [2024-11-09 14:48:01,522 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 11 treesize of output 7 [2024-11-09 14:48:01,541 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 14:48:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 14:48:02,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:48:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555170132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:48:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:48:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2024-11-09 14:48:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759352462] [2024-11-09 14:48:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:48:02,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 14:48:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:48:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 14:48:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-11-09 14:48:02,171 INFO L87 Difference]: Start difference. First operand 2993 states and 4138 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:48:05,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 14:48:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:48:05,740 INFO L93 Difference]: Finished difference Result 7155 states and 9979 transitions. [2024-11-09 14:48:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 14:48:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 149 [2024-11-09 14:48:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:48:05,750 INFO L225 Difference]: With dead ends: 7155 [2024-11-09 14:48:05,751 INFO L226 Difference]: Without dead ends: 4208 [2024-11-09 14:48:05,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 14:48:05,755 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 721 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:48:05,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3677 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 666 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 14:48:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2024-11-09 14:48:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3081. [2024-11-09 14:48:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2943 states have (on average 1.3876996262317363) internal successors, (4084), 2955 states have internal predecessors, (4084), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:48:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4263 transitions. [2024-11-09 14:48:05,881 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4263 transitions. Word has length 149 [2024-11-09 14:48:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:48:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 4263 transitions. [2024-11-09 14:48:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:48:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4263 transitions. [2024-11-09 14:48:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 14:48:05,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:48:05,883 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:48:05,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 14:48:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:06,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:48:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:48:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1534678927, now seen corresponding path program 1 times [2024-11-09 14:48:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:48:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093874287] [2024-11-09 14:48:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:48:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 14:48:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 14:48:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:48:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 14:48:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 14:48:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:06,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093874287] [2024-11-09 14:48:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093874287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:48:06,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:48:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 14:48:06,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77915304] [2024-11-09 14:48:06,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:48:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 14:48:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:48:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 14:48:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 14:48:06,430 INFO L87 Difference]: Start difference. First operand 3081 states and 4263 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 14:48:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:48:07,108 INFO L93 Difference]: Finished difference Result 6142 states and 8514 transitions. [2024-11-09 14:48:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 14:48:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 150 [2024-11-09 14:48:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:48:07,115 INFO L225 Difference]: With dead ends: 6142 [2024-11-09 14:48:07,115 INFO L226 Difference]: Without dead ends: 3116 [2024-11-09 14:48:07,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:48:07,118 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 57 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 14:48:07,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3833 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 14:48:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-11-09 14:48:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3109. [2024-11-09 14:48:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 2971 states have (on average 1.3864018848872433) internal successors, (4119), 2983 states have internal predecessors, (4119), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:48:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 4298 transitions. [2024-11-09 14:48:07,194 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 4298 transitions. Word has length 150 [2024-11-09 14:48:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:48:07,195 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 4298 transitions. [2024-11-09 14:48:07,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 14:48:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4298 transitions. [2024-11-09 14:48:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 14:48:07,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:48:07,196 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:48:07,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 14:48:07,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:48:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:48:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 242504778, now seen corresponding path program 1 times [2024-11-09 14:48:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:48:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403382148] [2024-11-09 14:48:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:48:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 14:48:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 14:48:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:48:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 14:48:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 14:48:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403382148] [2024-11-09 14:48:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403382148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:48:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:48:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 14:48:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881642459] [2024-11-09 14:48:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:48:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:48:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:48:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:48:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:48:07,561 INFO L87 Difference]: Start difference. First operand 3109 states and 4298 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 14:48:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:48:08,081 INFO L93 Difference]: Finished difference Result 6187 states and 8569 transitions. [2024-11-09 14:48:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 14:48:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 150 [2024-11-09 14:48:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:48:08,089 INFO L225 Difference]: With dead ends: 6187 [2024-11-09 14:48:08,089 INFO L226 Difference]: Without dead ends: 3130 [2024-11-09 14:48:08,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 14:48:08,093 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 52 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 14:48:08,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2952 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 14:48:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-11-09 14:48:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3130. [2024-11-09 14:48:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 2992 states have (on average 1.3836898395721926) internal successors, (4140), 3004 states have internal predecessors, (4140), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:48:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4319 transitions. [2024-11-09 14:48:08,167 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4319 transitions. Word has length 150 [2024-11-09 14:48:08,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:48:08,167 INFO L471 AbstractCegarLoop]: Abstraction has 3130 states and 4319 transitions. [2024-11-09 14:48:08,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 14:48:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4319 transitions. [2024-11-09 14:48:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 14:48:08,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:48:08,168 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:48:08,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 14:48:08,168 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:48:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:48:08,169 INFO L85 PathProgramCache]: Analyzing trace with hash 985063040, now seen corresponding path program 1 times [2024-11-09 14:48:08,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:48:08,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026359358] [2024-11-09 14:48:08,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:48:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 14:48:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 14:48:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 14:48:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 14:48:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 14:48:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026359358] [2024-11-09 14:48:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026359358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:48:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158637168] [2024-11-09 14:48:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:08,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:48:08,999 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:48:09,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 14:48:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:09,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 14:48:09,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:48:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 14:48:09,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:48:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158637168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:48:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:48:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-09 14:48:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541065836] [2024-11-09 14:48:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:48:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:48:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:48:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:48:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-09 14:48:09,608 INFO L87 Difference]: Start difference. First operand 3130 states and 4319 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:48:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:48:09,903 INFO L93 Difference]: Finished difference Result 6233 states and 8616 transitions. [2024-11-09 14:48:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:48:09,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 151 [2024-11-09 14:48:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:48:09,910 INFO L225 Difference]: With dead ends: 6233 [2024-11-09 14:48:09,910 INFO L226 Difference]: Without dead ends: 3151 [2024-11-09 14:48:09,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-11-09 14:48:09,914 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 43 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:48:09,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3170 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:48:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2024-11-09 14:48:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3056. [2024-11-09 14:48:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2918 states have (on average 1.3783413296778615) internal successors, (4022), 2930 states have internal predecessors, (4022), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:48:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4201 transitions. [2024-11-09 14:48:09,994 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 4201 transitions. Word has length 151 [2024-11-09 14:48:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:48:09,995 INFO L471 AbstractCegarLoop]: Abstraction has 3056 states and 4201 transitions. [2024-11-09 14:48:09,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 14:48:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 4201 transitions. [2024-11-09 14:48:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 14:48:09,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:48:09,996 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:48:10,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 14:48:10,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 14:48:10,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:48:10,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:48:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2133926409, now seen corresponding path program 1 times [2024-11-09 14:48:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:48:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599328720] [2024-11-09 14:48:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:48:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 14:48:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 14:48:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 14:48:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 14:48:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 14:48:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599328720] [2024-11-09 14:48:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599328720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:48:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348106512] [2024-11-09 14:48:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:11,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:48:11,124 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:48:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 14:48:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:11,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 14:48:11,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:48:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 86 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 14:48:12,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:48:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 14:48:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348106512] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:48:12,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:48:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 15] total 45 [2024-11-09 14:48:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764491338] [2024-11-09 14:48:12,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:48:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 14:48:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:48:12,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 14:48:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 14:48:12,533 INFO L87 Difference]: Start difference. First operand 3056 states and 4201 transitions. Second operand has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:48:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:48:17,121 INFO L93 Difference]: Finished difference Result 6148 states and 8525 transitions. [2024-11-09 14:48:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 14:48:17,122 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 151 [2024-11-09 14:48:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:48:17,133 INFO L225 Difference]: With dead ends: 6148 [2024-11-09 14:48:17,133 INFO L226 Difference]: Without dead ends: 3180 [2024-11-09 14:48:17,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2024-11-09 14:48:17,139 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 126 mSDsluCounter, 16933 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 17494 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:48:17,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 17494 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 14:48:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-11-09 14:48:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3146. [2024-11-09 14:48:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3008 states have (on average 1.3690159574468086) internal successors, (4118), 3020 states have internal predecessors, (4118), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-09 14:48:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4297 transitions. [2024-11-09 14:48:17,236 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4297 transitions. Word has length 151 [2024-11-09 14:48:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:48:17,237 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4297 transitions. [2024-11-09 14:48:17,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 14:48:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4297 transitions. [2024-11-09 14:48:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 14:48:17,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:48:17,238 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:48:17,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 14:48:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:17,443 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:48:17,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:48:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1438529495, now seen corresponding path program 2 times [2024-11-09 14:48:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:48:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865088550] [2024-11-09 14:48:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:48:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:48:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:18,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 14:48:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:48:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 14:48:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 14:48:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 14:48:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:48:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 7 proven. 534 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 14:48:19,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:48:19,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865088550] [2024-11-09 14:48:19,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865088550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:48:19,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83375307] [2024-11-09 14:48:19,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:48:19,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:48:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:48:19,092 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:48:19,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 14:48:19,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:48:19,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:48:19,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 293 conjuncts are in the unsatisfiable core [2024-11-09 14:48:19,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:48:19,997 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 11 treesize of output 7 [2024-11-09 14:48:20,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 14:48:20,100 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 11 treesize of output 7 [2024-11-09 14:48:20,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 14:48:20,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 14:48:20,523 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 14:48:20,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 14:48:20,569 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 11 treesize of output 7 [2024-11-09 14:48:20,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 14:48:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 14:48:20,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 14:48:21,405 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 14:48:21,406 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 14:48:21,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 14:48:21,520 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:21,541 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:21,558 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-09 14:48:21,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1015 [2024-11-09 14:48:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-09 14:48:21,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 17 [2024-11-09 14:48:21,628 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:21,655 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-09 14:48:21,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1015 [2024-11-09 14:48:21,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-09 14:48:21,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 17 [2024-11-09 14:48:21,700 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:21,738 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1394 treesize of output 1344 [2024-11-09 14:48:21,756 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1259 treesize of output 1233 [2024-11-09 14:48:21,771 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-09 14:48:21,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1262 treesize of output 995 [2024-11-09 14:48:21,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 14:48:21,828 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:21,841 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:21,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:21,857 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:21,879 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:21,890 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:21,905 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:21,925 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1243 treesize of output 1221 [2024-11-09 14:48:21,941 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1108 treesize of output 1110 [2024-11-09 14:48:21,952 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 1 [2024-11-09 14:48:21,995 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:21,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:22,008 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:22,028 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:22,046 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:22,063 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:22,075 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:22,114 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:22,129 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:22,145 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:22,162 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1394 treesize of output 1344 [2024-11-09 14:48:22,174 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1262 treesize of output 1 [2024-11-09 14:48:22,187 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1259 treesize of output 1233 [2024-11-09 14:48:22,230 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1108 treesize of output 1110 [2024-11-09 14:48:22,242 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 1 [2024-11-09 14:48:22,257 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1243 treesize of output 1221 [2024-11-09 14:48:22,271 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-09 14:48:22,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-09 14:48:22,285 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-09 14:48:22,301 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-09 14:48:22,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-09 14:48:22,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 14:48:22,636 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 14:48:22,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 14:48:22,721 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 14:48:22,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-11-09 14:48:22,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:48:22,730 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-09 14:48:22,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 23 [2024-11-09 14:48:22,751 INFO L349 Elim1Store]: treesize reduction 137, result has 9.9 percent of original size [2024-11-09 14:48:22,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 110 [2024-11-09 14:48:22,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:48:22,765 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-11-09 14:48:22,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2024-11-09 14:48:38,919 WARN L286 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 388 DAG size of output: 79 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 14:48:38,920 INFO L349 Elim1Store]: treesize reduction 3832, result has 4.4 percent of original size [2024-11-09 14:48:38,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 17 new quantified variables, introduced 20 case distinctions, treesize of input 400 treesize of output 421 [2024-11-09 14:48:39,565 INFO L349 Elim1Store]: treesize reduction 2867, result has 10.2 percent of original size [2024-11-09 14:48:39,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 14 new quantified variables, introduced 13 case distinctions, treesize of input 740 treesize of output 800 [2024-11-09 14:48:41,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:48:41,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:48:42,371 INFO L349 Elim1Store]: treesize reduction 1498, result has 4.9 percent of original size [2024-11-09 14:48:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 3 disjoint index pairs (out of 120 index pairs), introduced 29 new quantified variables, introduced 130 case distinctions, treesize of input 819 treesize of output 546 [2024-11-09 14:48:42,621 INFO L349 Elim1Store]: treesize reduction 740, result has 2.5 percent of original size [2024-11-09 14:48:42,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 4 disjoint index pairs (out of 105 index pairs), introduced 26 new quantified variables, introduced 71 case distinctions, treesize of input 751 treesize of output 557 [2024-11-09 14:48:45,098 INFO L349 Elim1Store]: treesize reduction 1228, result has 8.8 percent of original size [2024-11-09 14:48:45,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 29 new quantified variables, introduced 119 case distinctions, treesize of input 916 treesize of output 582 [2024-11-09 14:48:45,196 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-11-09 14:48:45,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 912 treesize of output 619 [2024-11-09 14:48:45,236 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-09 14:48:45,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 738 treesize of output 591 [2024-11-09 14:48:45,288 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-09 14:48:45,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 554 treesize of output 376 [2024-11-09 14:48:45,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:48:45,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 494 treesize of output 352 [2024-11-09 14:48:45,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 31 [2024-11-09 14:48:45,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 122 [2024-11-09 14:48:45,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 31 [2024-11-09 14:48:45,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:48:45,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 221 [2024-11-09 14:48:46,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 184 [2024-11-09 14:48:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 12 proven. 447 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-09 14:48:47,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:48:47,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse0 (select |c_#memory_$Pointer$#3.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#3.base| .cse2)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse1 (+ .cse5 .cse6 (- 51539607548))) (.cse3 (+ (- 51539607552) .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_6990 .cse1)) v_ArrVal_6990)) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse2) .cse3) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 (store .cse4 .cse1 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse2) .cse3) 0)))) (< .cse7 2147483648)) (or (let ((.cse8 (+ .cse5 .cse6 4)) (.cse9 (+ .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store .cse0 .cse8 (select v_ArrVal_6990 .cse8)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse2) .cse9) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 (store .cse4 .cse8 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse2) .cse9) 0)))) (< 2147483647 .cse7))))))) is different from false [2024-11-09 14:48:47,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_#t~bitwise115#1| 4294967296)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse2 (select |c_#memory_$Pointer$#3.offset| .cse0)) (.cse4 (select |c_#memory_$Pointer$#3.base| .cse0)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse3 (+ .cse5 .cse6 (- 51539607548))) (.cse1 (+ .cse5 (- 51539607552) .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse1) 0)) (not (= (store .cse2 .cse3 (select v_ArrVal_6990 .cse3)) v_ArrVal_6990)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store .cse4 .cse3 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse1) 0)))) (< .cse7 2147483648)) (or (< 2147483647 .cse7) (let ((.cse8 (+ .cse5 .cse6 4)) (.cse9 (+ .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store .cse2 .cse8 (select v_ArrVal_6990 .cse8)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse9) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store .cse4 .cse8 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse9) 0)))))))))) is different from false [2024-11-09 14:48:47,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.offset| .cse3) .cse4))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse3) .cse4))) (and (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store (select |c_#memory_$Pointer$#3.base| .cse0) .cse1 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse2) 0)) (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store (select |c_#memory_$Pointer$#3.offset| .cse0) .cse1 (select v_ArrVal_6990 .cse1)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse2) 0))))))))) is different from false [2024-11-09 14:48:47,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#3.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$#3.offset| .cse7)) (.cse9 (+ (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse6) 12))) (and (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int) (v_ArrVal_6985 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_6986)) (.cse0 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_6985)))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse2 (select (select .cse5 .cse3) .cse4))) (select (let ((.cse1 (select (select .cse0 .cse3) .cse4))) (select (store (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 4) v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse1)) .cse2)))) 0)) (not (= (store .cse10 .cse9 (select v_ArrVal_6986 .cse9)) v_ArrVal_6986)))) (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6990 (Array Int Int)) (v_ArrVal_6985 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_6986)) (.cse17 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_6985)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6)) (.cse16 (select (select .cse11 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse12 (select (select .cse17 .cse15) .cse16)) (.cse13 (select (select .cse11 .cse15) .cse16))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store .cse11 .cse12 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse12) .cse13) 0)) (not (= (let ((.cse14 (+ .cse13 4))) (store (select .cse11 .cse12) .cse14 (select v_ArrVal_6990 .cse14))) v_ArrVal_6990))))))) (not (= (store .cse10 .cse9 (select v_ArrVal_6986 .cse9)) v_ArrVal_6986)))))))) is different from false [2024-11-09 14:48:47,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (select |c_#memory_$Pointer$#3.base| .cse10)) (.cse0 (select |c_#memory_$Pointer$#3.offset| .cse10)) (.cse1 (+ 12 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)))) (and (forall ((v_ArrVal_6986 (Array Int Int))) (or (not (= v_ArrVal_6986 (store .cse0 .cse1 (select v_ArrVal_6986 .cse1)))) (forall ((v_ArrVal_6990 (Array Int Int)) (v_ArrVal_6985 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_6986)) (.cse8 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_6985)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse3 (select (select .cse8 .cse6) .cse7)) (.cse4 (select (select .cse2 .cse6) .cse7))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store .cse2 .cse3 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse3) .cse4) 0)) (not (= (let ((.cse5 (+ .cse4 4))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_6990 .cse5))) v_ArrVal_6990))))))))) (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int) (v_ArrVal_6985 Int)) (= (let ((.cse17 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_6986)) (.cse12 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_6985)))) (let ((.cse15 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)) (.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse14 (select (select .cse17 .cse15) .cse16))) (select (let ((.cse13 (select (select .cse12 .cse15) .cse16))) (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) (+ .cse14 4) v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse13)) .cse14)))) 0)) (not (= v_ArrVal_6986 (store .cse0 .cse1 (select v_ArrVal_6986 .cse1)))))))))) is different from false