./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_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_OAT_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 bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:44:33,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:44:33,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 14:44:33,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:44:33,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:44:33,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:44:33,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:44:33,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:44:33,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:44:33,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:44:33,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:44:33,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:44:33,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:44:33,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:44:33,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:44:33,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:44:33,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:44:33,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 14:44:33,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:44:33,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 14:44:33,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:44:33,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:44:33,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:44:33,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:44:33,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:44:33,758 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:44:33,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:44:33,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 14:44:33,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:44:33,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:44:33,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:44:33,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:44:33,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:44:33,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:44:33,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:44:33,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:44:33,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:44:33,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:44:33,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:44:33,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:44:33,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:44:33,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:44:33,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:44:33,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:44:33,767 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 -> bd635b7902366e8a0b08b14a90a1f3949f04bf734a3e09a83f5077ced842f5da [2024-11-09 14:44:34,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:44:34,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:44:34,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:44:34,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:44:34,032 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:44:34,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-09 14:44:35,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:44:35,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:44:35,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-2.i [2024-11-09 14:44:35,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b8b2855/a58cb9924c174a1e9d5ecbb56cdea316/FLAG1c20315ec [2024-11-09 14:44:35,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b8b2855/a58cb9924c174a1e9d5ecbb56cdea316 [2024-11-09 14:44:35,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:44:35,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:44:35,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:44:35,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:44:35,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:44:35,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:44:35" (1/1) ... [2024-11-09 14:44:35,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2045d15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:35, skipping insertion in model container [2024-11-09 14:44:35,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:44:35" (1/1) ... [2024-11-09 14:44:35,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:44:36,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:44:36,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:44:36,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:44:36,602 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:44:36,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36 WrapperNode [2024-11-09 14:44:36,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:44:36,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:44:36,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:44:36,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:44:36,609 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:44:36" (1/1) ... [2024-11-09 14:44:36,647 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:44:36" (1/1) ... [2024-11-09 14:44:36,715 INFO L138 Inliner]: procedures = 282, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1657 [2024-11-09 14:44:36,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:44:36,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:44:36,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:44:36,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:44:36,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,847 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 34, 12, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 62 writes are split as follows [0, 4, 1, 57]. [2024-11-09 14:44:36,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:44:36,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:44:36,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:44:36,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:44:36,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (1/1) ... [2024-11-09 14:44:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:44:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:36,959 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:44:36,961 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:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 14:44:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-09 14:44:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-09 14:44:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 14:44:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:44:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-09 14:44:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-09 14:44:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:44:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:44:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:44:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 14:44:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:44:36,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:44:37,175 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:44:37,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:44:38,299 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2024-11-09 14:44:38,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:44:38,328 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:44:38,329 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-09 14:44:38,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:44:38 BoogieIcfgContainer [2024-11-09 14:44:38,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:44:38,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:44:38,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:44:38,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:44:38,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:44:35" (1/3) ... [2024-11-09 14:44:38,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c6cf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:44:38, skipping insertion in model container [2024-11-09 14:44:38,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:36" (2/3) ... [2024-11-09 14:44:38,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c6cf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:44:38, skipping insertion in model container [2024-11-09 14:44:38,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:44:38" (3/3) ... [2024-11-09 14:44:38,337 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-2.i [2024-11-09 14:44:38,349 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:44:38,349 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 14:44:38,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:44:38,415 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;@1a429a7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:44:38,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 14:44:38,420 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:44:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:44:38,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:38,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:44:38,428 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:44:38,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1635847084, now seen corresponding path program 1 times [2024-11-09 14:44:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:38,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52511552] [2024-11-09 14:44:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:38,605 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:44:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52511552] [2024-11-09 14:44:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52511552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:44:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088886150] [2024-11-09 14:44:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:38,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:44:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:44:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:44:38,632 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:44:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:38,684 INFO L93 Difference]: Finished difference Result 995 states and 1569 transitions. [2024-11-09 14:44:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:44:38,686 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:44:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:38,695 INFO L225 Difference]: With dead ends: 995 [2024-11-09 14:44:38,695 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 14:44:38,700 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:44:38,703 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:44:38,703 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:44:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 14:44:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-11-09 14:44:38,749 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:44:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 683 transitions. [2024-11-09 14:44:38,754 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 683 transitions. Word has length 8 [2024-11-09 14:44:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 683 transitions. [2024-11-09 14:44:38,756 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:44:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 683 transitions. [2024-11-09 14:44:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:44:38,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:38,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:44:38,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:44:38,757 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:44:38,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:38,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1635849006, now seen corresponding path program 1 times [2024-11-09 14:44:38,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:38,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2907631] [2024-11-09 14:44:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:44:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340835400] [2024-11-09 14:44:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:38,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:38,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:38,810 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:44:38,811 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:44:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:38,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:44:38,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:39,027 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 15 treesize of output 1 [2024-11-09 14:44:39,052 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 22 treesize of output 10 [2024-11-09 14:44:39,062 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:44:39,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2907631] [2024-11-09 14:44:39,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:44:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340835400] [2024-11-09 14:44:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340835400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:44:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612588082] [2024-11-09 14:44:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:39,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:39,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:39,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:39,068 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:44:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:39,245 INFO L93 Difference]: Finished difference Result 940 states and 1333 transitions. [2024-11-09 14:44:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:44:39,246 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:44:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:39,250 INFO L225 Difference]: With dead ends: 940 [2024-11-09 14:44:39,251 INFO L226 Difference]: Without dead ends: 939 [2024-11-09 14:44:39,252 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:44:39,253 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 615 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:39,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1960 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-11-09 14:44:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 493. [2024-11-09 14:44:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 460 states have (on average 1.434782608695652) internal successors, (660), 474 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:44:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 690 transitions. [2024-11-09 14:44:39,284 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 690 transitions. Word has length 8 [2024-11-09 14:44:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:39,284 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 690 transitions. [2024-11-09 14:44:39,284 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:44:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 690 transitions. [2024-11-09 14:44:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 14:44:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:39,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:44:39,300 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:44:39,490 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:44:39,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -828288263, now seen corresponding path program 1 times [2024-11-09 14:44:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078702732] [2024-11-09 14:44:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:44:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947658856] [2024-11-09 14:44:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:39,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:39,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:39,536 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:44:39,538 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:44:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:39,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 14:44:39,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:39,693 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:44:39,720 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:44:39,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078702732] [2024-11-09 14:44:39,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:44:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947658856] [2024-11-09 14:44:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947658856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:39,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:44:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649149130] [2024-11-09 14:44:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:39,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:39,723 INFO L87 Difference]: Start difference. First operand 493 states and 690 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:44:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:39,877 INFO L93 Difference]: Finished difference Result 939 states and 1332 transitions. [2024-11-09 14:44:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:44:39,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-09 14:44:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:39,884 INFO L225 Difference]: With dead ends: 939 [2024-11-09 14:44:39,884 INFO L226 Difference]: Without dead ends: 938 [2024-11-09 14:44:39,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:44:39,887 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 613 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:39,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2054 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-09 14:44:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 494. [2024-11-09 14:44:39,911 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:44:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 691 transitions. [2024-11-09 14:44:39,914 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 691 transitions. Word has length 9 [2024-11-09 14:44:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:39,914 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 691 transitions. [2024-11-09 14:44:39,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:44:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 691 transitions. [2024-11-09 14:44:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 14:44:39,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:39,920 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:44:39,934 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:44:40,120 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,SelfDestructingSolverStorable2 [2024-11-09 14:44:40,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1086501261, now seen corresponding path program 1 times [2024-11-09 14:44:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:40,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27548550] [2024-11-09 14:44:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 14:44:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 14:44:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 14:44:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,321 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:44:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27548550] [2024-11-09 14:44:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27548550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:44:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736947876] [2024-11-09 14:44:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:40,324 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:44:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:40,425 INFO L93 Difference]: Finished difference Result 1192 states and 1688 transitions. [2024-11-09 14:44:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:44:40,431 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:44:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:40,436 INFO L225 Difference]: With dead ends: 1192 [2024-11-09 14:44:40,436 INFO L226 Difference]: Without dead ends: 937 [2024-11-09 14:44:40,437 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:44:40,438 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 616 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2082 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:44:40,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2082 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-09 14:44:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 494. [2024-11-09 14:44:40,460 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:44:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 690 transitions. [2024-11-09 14:44:40,463 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 690 transitions. Word has length 34 [2024-11-09 14:44:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:40,464 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 690 transitions. [2024-11-09 14:44:40,464 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:44:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 690 transitions. [2024-11-09 14:44:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:44:40,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:40,468 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:44:40,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:44:40,468 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:44:40,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash 185612591, now seen corresponding path program 1 times [2024-11-09 14:44:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831139405] [2024-11-09 14:44:40,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,685 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:44:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831139405] [2024-11-09 14:44:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831139405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:44:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269842726] [2024-11-09 14:44:40,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:40,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:40,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:40,688 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:44:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:40,754 INFO L93 Difference]: Finished difference Result 937 states and 1305 transitions. [2024-11-09 14:44:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:44:40,754 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:44:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:40,756 INFO L225 Difference]: With dead ends: 937 [2024-11-09 14:44:40,756 INFO L226 Difference]: Without dead ends: 452 [2024-11-09 14:44:40,757 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:44:40,757 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 30 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:40,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1724 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-09 14:44:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-11-09 14:44:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 419 states have (on average 1.3914081145584725) internal successors, (583), 433 states have internal predecessors, (583), 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:44:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 613 transitions. [2024-11-09 14:44:40,768 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 613 transitions. Word has length 64 [2024-11-09 14:44:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 613 transitions. [2024-11-09 14:44:40,769 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:44:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 613 transitions. [2024-11-09 14:44:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:44:40,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:40,771 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:44:40,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 14:44:40,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:40,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -878587357, now seen corresponding path program 1 times [2024-11-09 14:44:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333974715] [2024-11-09 14:44:40,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:40,967 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:44:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333974715] [2024-11-09 14:44:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333974715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:44:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501384322] [2024-11-09 14:44:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:40,971 INFO L87 Difference]: Start difference. First operand 452 states and 613 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:44:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:41,022 INFO L93 Difference]: Finished difference Result 825 states and 1128 transitions. [2024-11-09 14:44:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:44:41,023 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:44:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:41,028 INFO L225 Difference]: With dead ends: 825 [2024-11-09 14:44:41,028 INFO L226 Difference]: Without dead ends: 821 [2024-11-09 14:44:41,028 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:44:41,029 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 440 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1780 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:44:41,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1780 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:44:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-09 14:44:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 813. [2024-11-09 14:44:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 772 states have (on average 1.3989637305699483) internal successors, (1080), 788 states have internal predecessors, (1080), 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:44:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1124 transitions. [2024-11-09 14:44:41,055 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1124 transitions. Word has length 64 [2024-11-09 14:44:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1124 transitions. [2024-11-09 14:44:41,057 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:44:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1124 transitions. [2024-11-09 14:44:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 14:44:41,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:41,061 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:44:41,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 14:44:41,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:41,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash -240672312, now seen corresponding path program 1 times [2024-11-09 14:44:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:41,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028025611] [2024-11-09 14:44:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:41,275 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:44:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028025611] [2024-11-09 14:44:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028025611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:41,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:41,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:44:41,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381990084] [2024-11-09 14:44:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:44:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:44:41,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:44:41,278 INFO L87 Difference]: Start difference. First operand 813 states and 1124 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:44:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:41,432 INFO L93 Difference]: Finished difference Result 1087 states and 1500 transitions. [2024-11-09 14:44:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:44:41,432 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:44:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:41,438 INFO L225 Difference]: With dead ends: 1087 [2024-11-09 14:44:41,438 INFO L226 Difference]: Without dead ends: 1085 [2024-11-09 14:44:41,439 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:44:41,440 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 496 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1695 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:44:41,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1695 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-09 14:44:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1075. [2024-11-09 14:44:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1021 states have (on average 1.404505386875612) internal successors, (1434), 1038 states have internal predecessors, (1434), 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:44:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1498 transitions. [2024-11-09 14:44:41,466 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1498 transitions. Word has length 74 [2024-11-09 14:44:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:41,467 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1498 transitions. [2024-11-09 14:44:41,467 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:44:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1498 transitions. [2024-11-09 14:44:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 14:44:41,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:41,473 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:44:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 14:44:41,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 980932139, now seen corresponding path program 1 times [2024-11-09 14:44:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487159396] [2024-11-09 14:44:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:41,840 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:44:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487159396] [2024-11-09 14:44:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487159396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368500342] [2024-11-09 14:44:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:41,842 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:44:41,843 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:44:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:42,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:44:42,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:42,105 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:44:42,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368500342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:44:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-09 14:44:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725030944] [2024-11-09 14:44:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:42,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:44:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:44:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:44:42,108 INFO L87 Difference]: Start difference. First operand 1075 states and 1498 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:44:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:42,166 INFO L93 Difference]: Finished difference Result 1450 states and 2014 transitions. [2024-11-09 14:44:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:44:42,167 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:44:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:42,171 INFO L225 Difference]: With dead ends: 1450 [2024-11-09 14:44:42,172 INFO L226 Difference]: Without dead ends: 1449 [2024-11-09 14:44:42,172 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:44:42,173 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 560 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2285 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:44:42,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2285 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:44:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-09 14:44:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1399. [2024-11-09 14:44:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1338 states have (on average 1.407324364723468) internal successors, (1883), 1357 states have internal predecessors, (1883), 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:44:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1957 transitions. [2024-11-09 14:44:42,217 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1957 transitions. Word has length 83 [2024-11-09 14:44:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:42,217 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1957 transitions. [2024-11-09 14:44:42,217 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:44:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1957 transitions. [2024-11-09 14:44:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 14:44:42,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:42,218 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:44:42,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 14:44:42,422 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:44:42,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash 344125278, now seen corresponding path program 1 times [2024-11-09 14:44:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626529735] [2024-11-09 14:44:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:42,703 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:44:42,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626529735] [2024-11-09 14:44:42,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626529735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010048653] [2024-11-09 14:44:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:42,716 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:44:42,717 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:44:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:42,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 14:44:42,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:43,058 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:44:43,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:44:43,277 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:44:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010048653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:44:43,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:44:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-11-09 14:44:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795367814] [2024-11-09 14:44:43,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:44:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 14:44:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 14:44:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-09 14:44:43,280 INFO L87 Difference]: Start difference. First operand 1399 states and 1957 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:44:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:44,983 INFO L93 Difference]: Finished difference Result 3780 states and 5271 transitions. [2024-11-09 14:44:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 14:44:44,984 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:44:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:44,995 INFO L225 Difference]: With dead ends: 3780 [2024-11-09 14:44:44,996 INFO L226 Difference]: Without dead ends: 3778 [2024-11-09 14:44:44,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=1350, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 14:44:44,998 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 6356 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6381 SdHoareTripleChecker+Valid, 8688 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:44,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6381 Valid, 8688 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 14:44:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2024-11-09 14:44:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2801. [2024-11-09 14:44:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2681 states have (on average 1.3890339425587468) internal successors, (3724), 2702 states have internal predecessors, (3724), 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:44:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3913 transitions. [2024-11-09 14:44:45,063 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3913 transitions. Word has length 84 [2024-11-09 14:44:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 3913 transitions. [2024-11-09 14:44:45,064 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:44:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3913 transitions. [2024-11-09 14:44:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 14:44:45,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:45,065 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:44:45,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 14:44:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:45,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1558756002, now seen corresponding path program 1 times [2024-11-09 14:44:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822849165] [2024-11-09 14:44:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:45,362 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:44:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822849165] [2024-11-09 14:44:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822849165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:45,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:45,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:44:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457162068] [2024-11-09 14:44:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:45,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:44:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:44:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:44:45,363 INFO L87 Difference]: Start difference. First operand 2801 states and 3913 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:44:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:45,508 INFO L93 Difference]: Finished difference Result 5860 states and 8228 transitions. [2024-11-09 14:44:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:44:45,509 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:44:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:45,517 INFO L225 Difference]: With dead ends: 5860 [2024-11-09 14:44:45,517 INFO L226 Difference]: Without dead ends: 3068 [2024-11-09 14:44:45,520 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:44:45,521 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 344 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1393 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:44:45,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1393 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-11-09 14:44:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2954. [2024-11-09 14:44:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2840 states have (on average 1.4024647887323944) internal successors, (3983), 2860 states have internal predecessors, (3983), 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:44:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4165 transitions. [2024-11-09 14:44:45,577 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4165 transitions. Word has length 82 [2024-11-09 14:44:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:45,577 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4165 transitions. [2024-11-09 14:44:45,578 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:44:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4165 transitions. [2024-11-09 14:44:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 14:44:45,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:45,578 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:44:45,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 14:44:45,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1908045712, now seen corresponding path program 1 times [2024-11-09 14:44:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416623760] [2024-11-09 14:44:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:45,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:45,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:44:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:45,845 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:44:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416623760] [2024-11-09 14:44:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416623760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375717070] [2024-11-09 14:44:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:45,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:45,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:44:45,850 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:44:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:46,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 14:44:46,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:46,187 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:44:46,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:44:46,352 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:44:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375717070] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:44:46,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 13 [2024-11-09 14:44:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136733713] [2024-11-09 14:44:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:44:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:44:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:44:46,356 INFO L87 Difference]: Start difference. First operand 2954 states and 4165 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:44:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:46,453 INFO L93 Difference]: Finished difference Result 2954 states and 4165 transitions. [2024-11-09 14:44:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:44:46,453 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:44:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:46,462 INFO L225 Difference]: With dead ends: 2954 [2024-11-09 14:44:46,462 INFO L226 Difference]: Without dead ends: 2953 [2024-11-09 14:44:46,464 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:44:46,464 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1651 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:46,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 595 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2024-11-09 14:44:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2953. [2024-11-09 14:44:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2840 states have (on average 1.4007042253521127) internal successors, (3978), 2859 states have internal predecessors, (3978), 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:44:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4160 transitions. [2024-11-09 14:44:46,532 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4160 transitions. Word has length 93 [2024-11-09 14:44:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 4160 transitions. [2024-11-09 14:44:46,533 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:44:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4160 transitions. [2024-11-09 14:44:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 14:44:46,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:46,533 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:44:46,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 14:44:46,734 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:44:46,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:46,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 980125141, now seen corresponding path program 1 times [2024-11-09 14:44:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205422814] [2024-11-09 14:44:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:46,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:44:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:47,000 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:44:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205422814] [2024-11-09 14:44:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205422814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897219424] [2024-11-09 14:44:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:47,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:47,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:47,003 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:44:47,005 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:44:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:47,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 14:44:47,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:47,358 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:44:47,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:44:47,546 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:44:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897219424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:44:47,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:44:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 13 [2024-11-09 14:44:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335610972] [2024-11-09 14:44:47,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:44:47,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 14:44:47,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:47,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 14:44:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:44:47,549 INFO L87 Difference]: Start difference. First operand 2953 states and 4160 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:44:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:48,314 INFO L93 Difference]: Finished difference Result 5921 states and 8344 transitions. [2024-11-09 14:44:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 14:44:48,315 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:44:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:48,333 INFO L225 Difference]: With dead ends: 5921 [2024-11-09 14:44:48,334 INFO L226 Difference]: Without dead ends: 5920 [2024-11-09 14:44:48,337 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:44:48,339 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 2286 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 4903 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:48,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 4903 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 14:44:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2024-11-09 14:44:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 5482. [2024-11-09 14:44:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5482 states, 5260 states have (on average 1.4005703422053233) internal successors, (7367), 5284 states have internal predecessors, (7367), 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:44:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5482 states to 5482 states and 7723 transitions. [2024-11-09 14:44:48,489 INFO L78 Accepts]: Start accepts. Automaton has 5482 states and 7723 transitions. Word has length 94 [2024-11-09 14:44:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:48,489 INFO L471 AbstractCegarLoop]: Abstraction has 5482 states and 7723 transitions. [2024-11-09 14:44:48,490 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:44:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5482 states and 7723 transitions. [2024-11-09 14:44:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 14:44:48,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:48,493 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:44:48,507 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:44:48,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:48,694 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 14:44:48,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2083756214, now seen corresponding path program 1 times [2024-11-09 14:44:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:48,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226347016] [2024-11-09 14:44:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:44:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:44:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,046 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:44:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226347016] [2024-11-09 14:44:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226347016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:44:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:44:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373402439] [2024-11-09 14:44:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:44:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:44:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:44:49,049 INFO L87 Difference]: Start difference. First operand 5482 states and 7723 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:44:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:49,554 INFO L93 Difference]: Finished difference Result 7738 states and 10970 transitions. [2024-11-09 14:44:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 14:44:49,554 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:44:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:49,577 INFO L225 Difference]: With dead ends: 7738 [2024-11-09 14:44:49,577 INFO L226 Difference]: Without dead ends: 7736 [2024-11-09 14:44:49,582 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:44:49,583 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 488 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:49,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2538 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 14:44:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2024-11-09 14:44:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 5650. [2024-11-09 14:44:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5650 states, 5419 states have (on average 1.3960140247278097) internal successors, (7565), 5444 states have internal predecessors, (7565), 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:44:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 7942 transitions. [2024-11-09 14:44:49,737 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 7942 transitions. Word has length 120 [2024-11-09 14:44:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:49,738 INFO L471 AbstractCegarLoop]: Abstraction has 5650 states and 7942 transitions. [2024-11-09 14:44:49,738 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:44:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 7942 transitions. [2024-11-09 14:44:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 14:44:49,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:49,739 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:44:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 14:44:49,739 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:44:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1429916002, now seen corresponding path program 1 times [2024-11-09 14:44:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959770755] [2024-11-09 14:44:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 14:44:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 14:44:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 14:44:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:50,046 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:44:50,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959770755] [2024-11-09 14:44:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959770755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216414016] [2024-11-09 14:44:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:50,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:50,048 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:44:50,049 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:44:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:50,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 14:44:50,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:50,474 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:44:50,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216414016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:50,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:44:50,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-09 14:44:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165583832] [2024-11-09 14:44:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:50,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:44:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:44:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:44:50,480 INFO L87 Difference]: Start difference. First operand 5650 states and 7942 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:44:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:50,707 INFO L93 Difference]: Finished difference Result 10772 states and 15198 transitions. [2024-11-09 14:44:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 14:44:50,708 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:44:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:50,719 INFO L225 Difference]: With dead ends: 10772 [2024-11-09 14:44:50,719 INFO L226 Difference]: Without dead ends: 5442 [2024-11-09 14:44:50,726 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:44:50,726 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 85 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:50,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 3343 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5442 states. [2024-11-09 14:44:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5442 to 5442. [2024-11-09 14:44:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5442 states, 5228 states have (on average 1.400344299923489) internal successors, (7321), 5251 states have internal predecessors, (7321), 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:44:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 7670 transitions. [2024-11-09 14:44:50,861 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 7670 transitions. Word has length 127 [2024-11-09 14:44:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 5442 states and 7670 transitions. [2024-11-09 14:44:50,862 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:44:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 7670 transitions. [2024-11-09 14:44:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 14:44:50,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:50,863 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:44:50,878 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:44:51,064 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:44:51,064 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:44:51,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2038802715, now seen corresponding path program 1 times [2024-11-09 14:44:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:51,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612907820] [2024-11-09 14:44:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 14:44:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:44:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 14:44:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 14:44:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 14:44:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,459 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:44:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612907820] [2024-11-09 14:44:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612907820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730216211] [2024-11-09 14:44:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:51,462 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:44:51,463 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:44:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:51,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 14:44:51,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:51,804 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:44:51,820 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:44:51,833 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:44:52,362 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:44:52,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730216211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:52,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:44:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2024-11-09 14:44:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863800531] [2024-11-09 14:44:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 14:44:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 14:44:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:44:52,363 INFO L87 Difference]: Start difference. First operand 5442 states and 7670 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:44:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:53,503 INFO L93 Difference]: Finished difference Result 12937 states and 18318 transitions. [2024-11-09 14:44:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:44:53,504 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:44:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:53,521 INFO L225 Difference]: With dead ends: 12937 [2024-11-09 14:44:53,521 INFO L226 Difference]: Without dead ends: 7542 [2024-11-09 14:44:53,531 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:44:53,532 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 656 mSDsluCounter, 2976 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 3553 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 14:44:53,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 3553 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 14:44:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2024-11-09 14:44:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 5442. [2024-11-09 14:44:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5442 states, 5228 states have (on average 1.4001530221882172) internal successors, (7320), 5251 states have internal predecessors, (7320), 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:44:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 7669 transitions. [2024-11-09 14:44:53,659 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 7669 transitions. Word has length 132 [2024-11-09 14:44:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:53,659 INFO L471 AbstractCegarLoop]: Abstraction has 5442 states and 7669 transitions. [2024-11-09 14:44:53,660 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:44:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 7669 transitions. [2024-11-09 14:44:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 14:44:53,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:53,661 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:44:53,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 14:44:53,861 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:44:53,862 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:44:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 263134314, now seen corresponding path program 1 times [2024-11-09 14:44:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476478048] [2024-11-09 14:44:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:44:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:44:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:44:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 14:44:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 14:44:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,278 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:44:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476478048] [2024-11-09 14:44:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476478048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365499248] [2024-11-09 14:44:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:54,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:54,281 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:44:54,282 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:44:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:54,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 14:44:54,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:54,688 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:44:54,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:44:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365499248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:44:54,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:44:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2024-11-09 14:44:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870397081] [2024-11-09 14:44:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:44:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 14:44:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:44:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 14:44:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:44:54,694 INFO L87 Difference]: Start difference. First operand 5442 states and 7669 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:44:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:44:54,872 INFO L93 Difference]: Finished difference Result 8310 states and 11676 transitions. [2024-11-09 14:44:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:44:54,872 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:44:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:44:54,880 INFO L225 Difference]: With dead ends: 8310 [2024-11-09 14:44:54,881 INFO L226 Difference]: Without dead ends: 2953 [2024-11-09 14:44:54,888 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:44:54,889 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 13 mSDsluCounter, 4071 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4658 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:44:54,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4658 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:44:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2024-11-09 14:44:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2951. [2024-11-09 14:44:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2813 states have (on average 1.3878421613935301) internal successors, (3904), 2829 states have internal predecessors, (3904), 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:44:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4087 transitions. [2024-11-09 14:44:54,992 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4087 transitions. Word has length 133 [2024-11-09 14:44:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:44:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 2951 states and 4087 transitions. [2024-11-09 14:44:54,993 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:44:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4087 transitions. [2024-11-09 14:44:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 14:44:54,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:44:54,994 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:44:55,022 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:44:55,194 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:44:55,194 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:44:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:44:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 578798716, now seen corresponding path program 1 times [2024-11-09 14:44:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:44:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290840285] [2024-11-09 14:44:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:44:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:44:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 14:44:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 14:44:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 14:44:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:44:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:55,560 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:44:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:44:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290840285] [2024-11-09 14:44:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290840285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:44:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558361049] [2024-11-09 14:44:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:44:55,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:44:55,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:44:55,563 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:44:55,564 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:44:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:44:56,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-09 14:44:56,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:44:56,103 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:44:56,115 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:44:56,148 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:44:56,166 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:44:56,327 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:44:56,418 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 14:44:56,418 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:44:56,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 14:44:56,452 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 19 treesize of output 1 [2024-11-09 14:44:56,523 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 22 treesize of output 10 [2024-11-09 14:44:56,525 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 9 treesize of output 3 [2024-11-09 14:44:56,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 14:44:56,709 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 62 treesize of output 57 [2024-11-09 14:44:56,713 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 13 [2024-11-09 14:44:56,786 INFO L349 Elim1Store]: treesize reduction 51, result has 8.9 percent of original size [2024-11-09 14:44:56,787 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 2211 treesize of output 1726 [2024-11-09 14:44:56,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 268 [2024-11-09 14:44:56,840 INFO L349 Elim1Store]: treesize reduction 75, result has 23.5 percent of original size [2024-11-09 14:44:56,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 175 [2024-11-09 14:44:56,875 INFO L349 Elim1Store]: treesize reduction 91, result has 28.3 percent of original size [2024-11-09 14:44:56,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 198 [2024-11-09 14:44:56,917 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 20 treesize of output 1 [2024-11-09 14:44:56,949 INFO L349 Elim1Store]: treesize reduction 181, result has 14.6 percent of original size [2024-11-09 14:44:56,950 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 5 case distinctions, treesize of input 162 treesize of output 84 [2024-11-09 14:44:56,990 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 5 treesize of output 3 [2024-11-09 14:44:57,006 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,006 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 2214 treesize of output 2050 [2024-11-09 14:44:57,030 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,031 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 2363 treesize of output 2183 [2024-11-09 14:44:57,052 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-09 14:44:57,052 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 1146 treesize of output 1 [2024-11-09 14:44:57,072 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,073 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 1906 treesize of output 1800 [2024-11-09 14:44:57,098 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,099 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 2055 treesize of output 1933 [2024-11-09 14:44:57,125 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,125 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 3948 treesize of output 3401 [2024-11-09 14:44:57,150 INFO L349 Elim1Store]: treesize reduction 243, result has 0.4 percent of original size [2024-11-09 14:44:57,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2452 treesize of output 2057 [2024-11-09 14:44:57,184 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,185 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 3753 treesize of output 3230 [2024-11-09 14:44:57,222 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,223 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 3358 treesize of output 3023 [2024-11-09 14:44:57,246 INFO L349 Elim1Store]: treesize reduction 243, result has 0.4 percent of original size [2024-11-09 14:44:57,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2861 treesize of output 2386 [2024-11-09 14:44:57,277 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,278 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 3581 treesize of output 3214 [2024-11-09 14:44:57,304 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-09 14:44:57,304 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 2211 treesize of output 1 [2024-11-09 14:44:57,319 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,320 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 2214 treesize of output 2050 [2024-11-09 14:44:57,367 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,367 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 2363 treesize of output 2183 [2024-11-09 14:44:57,390 INFO L349 Elim1Store]: treesize reduction 243, result has 0.4 percent of original size [2024-11-09 14:44:57,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 2786 treesize of output 2323 [2024-11-09 14:44:57,415 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,416 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 4155 treesize of output 3556 [2024-11-09 14:44:57,448 INFO L349 Elim1Store]: treesize reduction 445, result has 0.2 percent of original size [2024-11-09 14:44:57,449 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 10 new quantified variables, introduced 12 case distinctions, treesize of input 4350 treesize of output 3727 [2024-11-09 14:44:57,468 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,469 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 2292 treesize of output 2122 [2024-11-09 14:44:57,485 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-09 14:44:57,486 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 2140 treesize of output 1 [2024-11-09 14:44:57,500 INFO L349 Elim1Store]: treesize reduction 345, result has 0.3 percent of original size [2024-11-09 14:44:57,501 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 2143 treesize of output 1989 [2024-11-09 14:44:57,539 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 17 treesize of output 7 [2024-11-09 14:44:57,651 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-09 14:44:57,651 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 22 treesize of output 24 [2024-11-09 14:44:57,807 INFO L349 Elim1Store]: treesize reduction 437, result has 12.8 percent of original size [2024-11-09 14:44:57,808 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 505 treesize of output 322 [2024-11-09 14:44:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:44:57,837 INFO L349 Elim1Store]: treesize reduction 45, result has 31.8 percent of original size [2024-11-09 14:44:57,838 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 152 [2024-11-09 14:44:57,854 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 7 treesize of output 3 [2024-11-09 14:44:58,017 INFO L349 Elim1Store]: treesize reduction 141, result has 0.7 percent of original size [2024-11-09 14:44:58,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 236 treesize of output 163 [2024-11-09 14:44:58,025 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-09 14:44:58,025 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 78 [2024-11-09 14:44:58,029 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 51 treesize of output 31 [2024-11-09 14:44:58,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:44:58,035 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-11-09 14:44:58,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 14:45:03,001 INFO L349 Elim1Store]: treesize reduction 2982, result has 29.3 percent of original size [2024-11-09 14:45:03,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 27 select indices, 27 select index equivalence classes, 1 disjoint index pairs (out of 351 index pairs), introduced 38 new quantified variables, introduced 378 case distinctions, treesize of input 13511 treesize of output 8641 [2024-11-09 14:45:03,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:03,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4550 treesize of output 4502 [2024-11-09 14:45:03,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:03,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4494 treesize of output 4394 [2024-11-09 14:45:04,222 INFO L349 Elim1Store]: treesize reduction 232, result has 27.7 percent of original size [2024-11-09 14:45:04,223 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 4790 treesize of output 4711 [2024-11-09 14:45:04,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:04,714 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 4427 treesize of output 4297 [2024-11-09 14:45:04,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:04,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4381 treesize of output 4277 [2024-11-09 14:45:05,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4285 treesize of output 4093 [2024-11-09 14:45:05,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:05,208 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 4004 treesize of output 3882 [2024-11-09 14:45:05,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:05,351 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 3900 treesize of output 3828 [2024-11-09 14:45:05,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:45:05,488 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 3897 treesize of output 3671 [2024-11-09 14:45:42,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:45:42,473 INFO L349 Elim1Store]: treesize reduction 146, result has 10.4 percent of original size [2024-11-09 14:45:42,473 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 7 new quantified variables, introduced 8 case distinctions, treesize of input 197 treesize of output 124 [2024-11-09 14:45:42,484 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2024-11-09 14:45:42,484 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 96 [2024-11-09 14:45:42,659 INFO L349 Elim1Store]: treesize reduction 110, result has 17.9 percent of original size [2024-11-09 14:45:42,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 148 [2024-11-09 14:45:42,680 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 14:45:42,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 262 treesize of output 168 [2024-11-09 14:45:42,685 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 193 treesize of output 125 [2024-11-09 14:45:42,690 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 14:45:42,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 76 [2024-11-09 14:45:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 14:45:42,699 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 0 case distinctions, treesize of input 52 treesize of output 38 [2024-11-09 14:45:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:45:42,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:45:42,798 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 ((.cse0 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse3 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse1 (select |c_#memory_$Pointer$#3.offset| .cse3)) (.cse5 (select |c_#memory_$Pointer$#3.base| .cse3)) (.cse6 (* .cse0 12)) (.cse7 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (< 2147483647 .cse0) (let ((.cse2 (+ .cse6 .cse7 4)) (.cse4 (+ .cse6 .cse7))) (and (forall ((v_ArrVal_2690 (Array Int Int))) (or (not (= v_ArrVal_2690 (store .cse1 .cse2 (select v_ArrVal_2690 .cse2)))) (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse3 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse3) .cse4) 0)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2693 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse3 (store .cse5 .cse2 v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse3) .cse4) 0))))) (or (let ((.cse9 (+ .cse6 .cse7 (- 51539607548))) (.cse8 (+ (- 51539607552) .cse6 .cse7))) (and (forall ((v_ArrVal_2690 (Array Int Int))) (or (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse3 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse3) .cse8) 0)) (not (= (store .cse1 .cse9 (select v_ArrVal_2690 .cse9)) v_ArrVal_2690)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2693 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse3 (store .cse5 .cse9 v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse3) .cse8) 0)))) (< .cse0 2147483648))))))) is different from false [2024-11-09 14:45:42,869 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 ((.cse0 (mod |c_ULTIMATE.start_main_#t~bitwise115#1| 4294967296)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse5 (select |c_#memory_$Pointer$#3.offset| .cse1)) (.cse2 (select |c_#memory_$Pointer$#3.base| .cse1)) (.cse6 (* .cse0 12)) (.cse7 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (< 2147483647 .cse0) (let ((.cse3 (+ .cse6 .cse7 4)) (.cse4 (+ .cse6 .cse7))) (and (forall ((v_ArrVal_2694 Int) (v_ArrVal_2693 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse1 (store .cse2 .cse3 v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse1) .cse4) 0)) (forall ((v_ArrVal_2690 (Array Int Int))) (or (not (= v_ArrVal_2690 (store .cse5 .cse3 (select v_ArrVal_2690 .cse3)))) (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse1) .cse4) 0))))))) (or (let ((.cse9 (+ .cse6 .cse7 (- 51539607548))) (.cse8 (+ .cse6 (- 51539607552) .cse7))) (and (forall ((v_ArrVal_2690 (Array Int Int))) (or (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse1) .cse8) 0)) (not (= (store .cse5 .cse9 (select v_ArrVal_2690 .cse9)) v_ArrVal_2690)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2693 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse1 (store .cse2 .cse9 v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse1) .cse8) 0)))) (< .cse0 2147483648))))))) is different from false [2024-11-09 14:45:42,883 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_2690 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#3.offset| .cse0) .cse1 (select v_ArrVal_2690 .cse1)) v_ArrVal_2690)) (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse0) .cse2) 0)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2693 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store (select |c_#memory_$Pointer$#3.base| .cse0) .cse1 v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse0) .cse2) 0))))))) is different from false [2024-11-09 14:45:42,944 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_2689 (Array Int Int))) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 Int) (v_ArrVal_2693 (Array Int Int))) (= (let ((.cse5 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_2689)) (.cse0 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_2688)))) (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_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse1)) .cse2)))) 0)) (not (= v_ArrVal_2689 (store .cse10 .cse9 (select v_ArrVal_2689 .cse9)))))) (forall ((v_ArrVal_2689 (Array Int Int))) (or (forall ((v_ArrVal_2688 Int) (v_ArrVal_2690 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_2689)) (.cse17 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_2688)))) (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_2692 (Array Int Int))) (= (select (select (store (store .cse11 .cse12 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse12) .cse13) 0)) (not (= (let ((.cse14 (+ .cse13 4))) (store (select .cse11 .cse12) .cse14 (select v_ArrVal_2690 .cse14))) v_ArrVal_2690))))))) (not (= v_ArrVal_2689 (store .cse10 .cse9 (select v_ArrVal_2689 .cse9)))))))))) is different from false [2024-11-09 14:45:42,985 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_2689 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2689 .cse1)) v_ArrVal_2689)) (forall ((v_ArrVal_2688 Int) (v_ArrVal_2690 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_2689)) (.cse8 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_2688)))) (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)) (.cse5 (select (select .cse2 .cse6) .cse7))) (or (not (= (let ((.cse4 (+ .cse5 4))) (store (select .cse2 .cse3) .cse4 (select v_ArrVal_2690 .cse4))) v_ArrVal_2690)) (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store .cse2 .cse3 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse3) .cse5) 0))))))))) (forall ((v_ArrVal_2689 (Array Int Int))) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 Int) (v_ArrVal_2693 (Array Int Int))) (= (let ((.cse17 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_2689)) (.cse12 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_2688)))) (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_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse13)) .cse14)))) 0)) (not (= (store .cse0 .cse1 (select v_ArrVal_2689 .cse1)) v_ArrVal_2689)))))))) is different from false [2024-11-09 14:45:43,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem101#1.base| (store (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem101#1.base|) |c_ULTIMATE.start_main_#t~mem101#1.offset| 0))) (.cse7 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse12 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem101#1.base| (store (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem101#1.base|) |c_ULTIMATE.start_main_#t~mem101#1.offset| 0))) (.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse13 (select .cse12 .cse9)) (.cse10 (select .cse8 .cse9)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7) 12))) (and (forall ((v_ArrVal_2689 (Array Int Int))) (or (forall ((v_ArrVal_2688 Int) (v_ArrVal_2690 (Array Int Int))) (let ((.cse0 (store .cse12 .cse9 v_ArrVal_2689)) (.cse6 (store .cse8 .cse9 (store .cse10 .cse11 v_ArrVal_2688)))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse1 (select (select .cse6 .cse4) .cse5)) (.cse3 (select (select .cse0 .cse4) .cse5))) (or (not (= (let ((.cse2 (+ .cse3 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2690 .cse2))) v_ArrVal_2690)) (forall ((v_ArrVal_2692 (Array Int Int))) (= (select (select (store (store .cse0 .cse1 v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2692) .cse1) .cse3) 0))))))) (not (= v_ArrVal_2689 (store .cse13 .cse11 (select v_ArrVal_2689 .cse11)))))) (forall ((v_ArrVal_2689 (Array Int Int))) (or (not (= v_ArrVal_2689 (store .cse13 .cse11 (select v_ArrVal_2689 .cse11)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 Int) (v_ArrVal_2693 (Array Int Int))) (= (let ((.cse19 (store .cse12 .cse9 v_ArrVal_2689)) (.cse14 (store .cse8 .cse9 (store .cse10 .cse11 v_ArrVal_2688)))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7)) (.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) .cse7))) (let ((.cse16 (select (select .cse19 .cse17) .cse18))) (select (let ((.cse15 (select (select .cse14 .cse17) .cse18))) (select (store (store .cse14 .cse15 (store (select .cse14 .cse15) (+ .cse16 4) v_ArrVal_2694)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_2693) .cse15)) .cse16)))) 0)))))))) is different from false [2024-11-09 14:45:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558361049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:45:43,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:45:43,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 32] total 38 [2024-11-09 14:45:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053578613] [2024-11-09 14:45:43,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:45:43,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 14:45:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:45:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 14:45:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1304, Unknown=12, NotChecked=462, Total=1892 [2024-11-09 14:45:43,139 INFO L87 Difference]: Start difference. First operand 2951 states and 4087 transitions. Second operand has 38 states, 35 states have (on average 6.3428571428571425) internal successors, (222), 32 states have internal predecessors, (222), 7 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 14:45:52,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 14:45:56,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]