./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-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 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:03:05,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:03:05,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:03:05,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:03:05,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:03:05,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:03:05,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:03:05,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:03:05,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:03:05,159 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:03:05,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:03:05,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:03:05,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:03:05,160 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:03:05,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:03:05,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:03:05,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:03:05,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:03:05,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:03:05,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2025-03-04 15:03:05,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:03:05,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:03:05,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:03:05,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:03:05,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:03:05,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2025-03-04 15:03:06,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6271bf993/09e928e805b143cd86bf26d57d7bb808/FLAGf38514b46 [2025-03-04 15:03:06,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:03:06,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2025-03-04 15:03:06,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6271bf993/09e928e805b143cd86bf26d57d7bb808/FLAGf38514b46 [2025-03-04 15:03:07,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6271bf993/09e928e805b143cd86bf26d57d7bb808 [2025-03-04 15:03:07,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:03:07,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:03:07,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:03:07,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:03:07,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:03:07,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6174fe8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07, skipping insertion in model container [2025-03-04 15:03:07,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:03:07,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:03:07,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:03:07,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:03:07,575 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:03:07,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07 WrapperNode [2025-03-04 15:03:07,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:03:07,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:03:07,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:03:07,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:03:07,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,651 INFO L138 Inliner]: procedures = 177, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1546 [2025-03-04 15:03:07,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:03:07,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:03:07,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:03:07,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:03:07,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,736 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [268, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2025-03-04 15:03:07,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:03:07,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:03:07,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:03:07,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:03:07,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (1/1) ... [2025-03-04 15:03:07,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:03:07,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:03:07,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:03:07,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 15:03:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 15:03:07,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 15:03:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 15:03:07,833 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 15:03:07,833 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 15:03:07,833 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-04 15:03:07,833 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-04 15:03:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:03:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:03:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:03:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:03:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:03:07,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:03:07,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:03:08,975 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 15:03:09,064 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-03-04 15:03:09,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:03:09,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:03:09,112 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 15:03:09,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:03:09 BoogieIcfgContainer [2025-03-04 15:03:09,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:03:09,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:03:09,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:03:09,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:03:09,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:03:07" (1/3) ... [2025-03-04 15:03:09,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:03:09, skipping insertion in model container [2025-03-04 15:03:09,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:03:07" (2/3) ... [2025-03-04 15:03:09,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:03:09, skipping insertion in model container [2025-03-04 15:03:09,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:03:09" (3/3) ... [2025-03-04 15:03:09,119 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2025-03-04 15:03:09,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:03:09,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test8-2.i that has 7 procedures, 488 locations, 1 initial locations, 40 loop locations, and 8 error locations. [2025-03-04 15:03:09,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:03:09,187 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;@7641157e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:03:09,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 15:03:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 480 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 470 states have internal predecessors, (726), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 15:03:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 15:03:09,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:09,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:09,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash -112548576, now seen corresponding path program 1 times [2025-03-04 15:03:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859250315] [2025-03-04 15:03:09,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:09,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:03:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:03:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:03:09,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859250315] [2025-03-04 15:03:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859250315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:09,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:03:09,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107632750] [2025-03-04 15:03:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:03:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:03:09,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:03:09,347 INFO L87 Difference]: Start difference. First operand has 480 states, 445 states have (on average 1.6314606741573034) internal successors, (726), 470 states have internal predecessors, (726), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-03-04 15:03:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:09,446 INFO L93 Difference]: Finished difference Result 956 states and 1554 transitions. [2025-03-04 15:03:09,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:03:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-04 15:03:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:09,462 INFO L225 Difference]: With dead ends: 956 [2025-03-04 15:03:09,462 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 15:03:09,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:03:09,469 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:09,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:03:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 15:03:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-04 15:03:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 407 states have (on average 1.4766584766584767) internal successors, (601), 429 states have internal predecessors, (601), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 15:03:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 641 transitions. [2025-03-04 15:03:09,524 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 641 transitions. Word has length 7 [2025-03-04 15:03:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 641 transitions. [2025-03-04 15:03:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-03-04 15:03:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2025-03-04 15:03:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 15:03:09,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:09,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:09,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:03:09,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -112547615, now seen corresponding path program 1 times [2025-03-04 15:03:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922722367] [2025-03-04 15:03:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:09,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:03:09,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:03:09,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:09,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:03:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427252415] [2025-03-04 15:03:09,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:09,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:03:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:03:09,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:03:09,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:03:09,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:03:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:03:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:09,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:03:09,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:03:09,730 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 [2025-03-04 15:03:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:03:09,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:03:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922722367] [2025-03-04 15:03:09,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:03:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427252415] [2025-03-04 15:03:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427252415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:09,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:09,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:03:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637091767] [2025-03-04 15:03:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:09,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:03:09,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:09,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:03:09,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:03:09,758 INFO L87 Difference]: Start difference. First operand 438 states and 641 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 15:03:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:10,008 INFO L93 Difference]: Finished difference Result 828 states and 1206 transitions. [2025-03-04 15:03:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:03:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-04 15:03:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:10,012 INFO L225 Difference]: With dead ends: 828 [2025-03-04 15:03:10,012 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 15:03:10,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:03:10,013 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 548 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:10,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1721 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:03:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 15:03:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 444. [2025-03-04 15:03:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4721549636803875) internal successors, (608), 435 states have internal predecessors, (608), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 15:03:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 648 transitions. [2025-03-04 15:03:10,049 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 648 transitions. Word has length 7 [2025-03-04 15:03:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:10,049 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 648 transitions. [2025-03-04 15:03:10,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 15:03:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 648 transitions. [2025-03-04 15:03:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 15:03:10,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:10,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:03:10,251 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 [2025-03-04 15:03:10,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1610499569, now seen corresponding path program 1 times [2025-03-04 15:03:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131917310] [2025-03-04 15:03:10,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:10,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:03:10,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:03:10,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:03:10,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:10,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131917310] [2025-03-04 15:03:10,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131917310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:10,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:10,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:03:10,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786309572] [2025-03-04 15:03:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:10,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:03:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:10,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:03:10,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:03:10,647 INFO L87 Difference]: Start difference. First operand 444 states and 648 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-03-04 15:03:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:10,870 INFO L93 Difference]: Finished difference Result 1055 states and 1547 transitions. [2025-03-04 15:03:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:03:10,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 70 [2025-03-04 15:03:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:10,873 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 15:03:10,873 INFO L226 Difference]: Without dead ends: 825 [2025-03-04 15:03:10,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:03:10,878 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 549 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:10,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1804 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:03:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-04 15:03:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 444. [2025-03-04 15:03:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4697336561743342) internal successors, (607), 435 states have internal predecessors, (607), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 15:03:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 647 transitions. [2025-03-04 15:03:10,905 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 647 transitions. Word has length 70 [2025-03-04 15:03:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:10,905 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 647 transitions. [2025-03-04 15:03:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-03-04 15:03:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 647 transitions. [2025-03-04 15:03:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 15:03:10,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:10,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:10,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:03:10,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:10,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1488959602, now seen corresponding path program 1 times [2025-03-04 15:03:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015876540] [2025-03-04 15:03:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:10,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 15:03:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:03:10,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:10,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:03:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015876540] [2025-03-04 15:03:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015876540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:03:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124844646] [2025-03-04 15:03:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:03:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:11,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:03:11,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:03:11,111 INFO L87 Difference]: Start difference. First operand 444 states and 647 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-04 15:03:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:11,252 INFO L93 Difference]: Finished difference Result 883 states and 1289 transitions. [2025-03-04 15:03:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:03:11,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 81 [2025-03-04 15:03:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:11,255 INFO L225 Difference]: With dead ends: 883 [2025-03-04 15:03:11,255 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 15:03:11,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:03:11,256 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 105 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:11,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1632 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:03:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 15:03:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2025-03-04 15:03:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 435 states have internal predecessors, (600), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 15:03:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 640 transitions. [2025-03-04 15:03:11,270 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 640 transitions. Word has length 81 [2025-03-04 15:03:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:11,270 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 640 transitions. [2025-03-04 15:03:11,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) [2025-03-04 15:03:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 640 transitions. [2025-03-04 15:03:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 15:03:11,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:11,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:11,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:03:11,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1941011801, now seen corresponding path program 1 times [2025-03-04 15:03:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732392408] [2025-03-04 15:03:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:11,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 15:03:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 15:03:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:03:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732392408] [2025-03-04 15:03:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732392408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:03:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516059072] [2025-03-04 15:03:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:03:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:03:11,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:03:11,427 INFO L87 Difference]: Start difference. First operand 444 states and 640 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-04 15:03:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:11,592 INFO L93 Difference]: Finished difference Result 1170 states and 1700 transitions. [2025-03-04 15:03:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:03:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 81 [2025-03-04 15:03:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:11,595 INFO L225 Difference]: With dead ends: 1170 [2025-03-04 15:03:11,596 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 15:03:11,597 INFO L434 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 [2025-03-04 15:03:11,599 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 371 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:11,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1326 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:03:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 15:03:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 731. [2025-03-04 15:03:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 699 states have (on average 1.463519313304721) internal successors, (1023), 721 states have internal predecessors, (1023), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 15:03:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2025-03-04 15:03:11,626 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 81 [2025-03-04 15:03:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:11,626 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2025-03-04 15:03:11,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2025-03-04 15:03:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2025-03-04 15:03:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 15:03:11,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:11,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:03:11,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash -262264674, now seen corresponding path program 1 times [2025-03-04 15:03:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052341483] [2025-03-04 15:03:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:11,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 15:03:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 15:03:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:03:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052341483] [2025-03-04 15:03:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052341483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:11,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:03:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941055125] [2025-03-04 15:03:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:11,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:03:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:11,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:03:11,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:03:11,853 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:03:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:11,999 INFO L93 Difference]: Finished difference Result 831 states and 1214 transitions. [2025-03-04 15:03:12,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:03:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-03-04 15:03:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:12,003 INFO L225 Difference]: With dead ends: 831 [2025-03-04 15:03:12,003 INFO L226 Difference]: Without dead ends: 829 [2025-03-04 15:03:12,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:03:12,006 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 223 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:12,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1733 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:03:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-04 15:03:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 800. [2025-03-04 15:03:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 763 states have (on average 1.4482306684141546) internal successors, (1105), 785 states have internal predecessors, (1105), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 15:03:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1155 transitions. [2025-03-04 15:03:12,028 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1155 transitions. Word has length 96 [2025-03-04 15:03:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:12,028 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1155 transitions. [2025-03-04 15:03:12,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:03:12,029 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1155 transitions. [2025-03-04 15:03:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 15:03:12,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:12,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:12,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:03:12,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1741413339, now seen corresponding path program 1 times [2025-03-04 15:03:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721744138] [2025-03-04 15:03:12,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:12,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 15:03:12,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 15:03:12,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:12,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:03:12,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:12,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721744138] [2025-03-04 15:03:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721744138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:03:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:03:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108792200] [2025-03-04 15:03:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:12,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:03:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:12,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:03:12,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:03:12,290 INFO L87 Difference]: Start difference. First operand 800 states and 1155 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:03:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:03:12,463 INFO L93 Difference]: Finished difference Result 1027 states and 1481 transitions. [2025-03-04 15:03:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:03:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 108 [2025-03-04 15:03:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:03:12,467 INFO L225 Difference]: With dead ends: 1027 [2025-03-04 15:03:12,467 INFO L226 Difference]: Without dead ends: 1025 [2025-03-04 15:03:12,468 INFO L434 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 [2025-03-04 15:03:12,468 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 457 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:03:12,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1704 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:03:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-04 15:03:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 803. [2025-03-04 15:03:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 766 states have (on average 1.4464751958224542) internal successors, (1108), 787 states have internal predecessors, (1108), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 15:03:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1158 transitions. [2025-03-04 15:03:12,485 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1158 transitions. Word has length 108 [2025-03-04 15:03:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:03:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1158 transitions. [2025-03-04 15:03:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:03:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1158 transitions. [2025-03-04 15:03:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 15:03:12,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:03:12,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:03:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:03:12,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:03:12,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:03:12,490 INFO L85 PathProgramCache]: Analyzing trace with hash -297640362, now seen corresponding path program 1 times [2025-03-04 15:03:12,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:03:12,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056112475] [2025-03-04 15:03:12,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:03:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:03:12,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:03:12,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:12,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:03:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:03:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056112475] [2025-03-04 15:03:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056112475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:03:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413106541] [2025-03-04 15:03:12,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:03:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:03:12,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:03:12,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:03:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:03:13,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:03:13,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:03:13,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:03:13,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:03:13,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:03:13,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:03:13,128 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 [2025-03-04 15:03:13,141 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 [2025-03-04 15:03:13,156 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 [2025-03-04 15:03:13,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:03:13,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-03-04 15:03:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:03:13,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:03:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413106541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:03:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:03:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 15:03:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853593963] [2025-03-04 15:03:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:03:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:03:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:03:13,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:03:13,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:03:13,686 INFO L87 Difference]: Start difference. First operand 803 states and 1158 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:03:21,831 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] [2025-03-04 15:03:25,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:03:29,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:03:34,063 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] [2025-03-04 15:03:38,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:03:42,269 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] [2025-03-04 15:03:46,353 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] [2025-03-04 15:03:50,403 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] [2025-03-04 15:03:54,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:04:00,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:04:04,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:04:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:08,522 INFO L93 Difference]: Finished difference Result 1794 states and 2584 transitions. [2025-03-04 15:04:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:04:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 1 states have call successors, (4), 1 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 114 [2025-03-04 15:04:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:08,526 INFO L225 Difference]: With dead ends: 1794 [2025-03-04 15:04:08,527 INFO L226 Difference]: Without dead ends: 1077 [2025-03-04 15:04:08,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2025-03-04 15:04:08,528 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 828 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 8 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 4123 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:08,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 4123 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1734 Invalid, 11 Unknown, 0 Unchecked, 46.4s Time] [2025-03-04 15:04:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-04 15:04:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 836. [2025-03-04 15:04:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 799 states have (on average 1.4392991239048811) internal successors, (1150), 820 states have internal predecessors, (1150), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 15:04:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1200 transitions. [2025-03-04 15:04:08,547 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1200 transitions. Word has length 114 [2025-03-04 15:04:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:08,547 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1200 transitions. [2025-03-04 15:04:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 15:04:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1200 transitions. [2025-03-04 15:04:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 15:04:08,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:08,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:08,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:04:08,748 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,SelfDestructingSolverStorable7 [2025-03-04 15:04:08,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:08,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -683007145, now seen corresponding path program 1 times [2025-03-04 15:04:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:08,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301363489] [2025-03-04 15:04:08,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:08,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:04:08,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:04:08,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:08,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:04:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301363489] [2025-03-04 15:04:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301363489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:08,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:04:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544151045] [2025-03-04 15:04:08,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:08,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:08,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:08,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:08,875 INFO L87 Difference]: Start difference. First operand 836 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:04:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:09,116 INFO L93 Difference]: Finished difference Result 1515 states and 2176 transitions. [2025-03-04 15:04:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:04:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2025-03-04 15:04:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:09,119 INFO L225 Difference]: With dead ends: 1515 [2025-03-04 15:04:09,119 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 15:04:09,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:04:09,123 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:09,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 15:04:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-04 15:04:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 670 states have (on average 1.4134328358208956) internal successors, (947), 691 states have internal predecessors, (947), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 15:04:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 997 transitions. [2025-03-04 15:04:09,142 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 997 transitions. Word has length 114 [2025-03-04 15:04:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:09,143 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 997 transitions. [2025-03-04 15:04:09,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:04:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 997 transitions. [2025-03-04 15:04:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 15:04:09,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:09,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:09,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:04:09,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:09,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -963803135, now seen corresponding path program 1 times [2025-03-04 15:04:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220610440] [2025-03-04 15:04:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:09,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:04:09,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:04:09,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:09,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:04:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220610440] [2025-03-04 15:04:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220610440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:04:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247621465] [2025-03-04 15:04:09,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:09,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:09,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:09,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:04:09,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:04:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:04:09,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:04:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:09,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:09,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:04:09,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:04:43,181 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)