./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:47:31,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:47:31,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:47:31,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:47:31,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:47:31,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:47:31,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:47:31,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:47:31,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:47:31,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:47:31,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:47:31,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:47:31,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:47:31,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:47:31,149 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:47:31,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:47:31,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:47:31,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:47:31,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:47:31,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:47:31,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:47:31,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:47:31,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:47:31,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:47:31,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:47:31,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:47:31,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:47:31,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:47:31,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:47:31,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:47:31,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:47:31,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:47:31,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:47:31,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:47:31,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:47:31,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:47:31,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:47:31,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:47:31,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:47:31,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2024-11-10 18:47:31,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:47:31,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:47:31,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:47:31,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:47:31,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:47:31,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-11-10 18:47:32,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:47:32,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:47:32,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2024-11-10 18:47:32,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476e1ec1a/472e6159df1248d19679b6b5c9cc55e1/FLAGe6fedfdbe [2024-11-10 18:47:32,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476e1ec1a/472e6159df1248d19679b6b5c9cc55e1 [2024-11-10 18:47:32,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:47:32,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:47:32,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:47:32,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:47:32,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:47:32,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:47:32" (1/1) ... [2024-11-10 18:47:32,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af3d09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:32, skipping insertion in model container [2024-11-10 18:47:32,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:47:32" (1/1) ... [2024-11-10 18:47:32,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:47:33,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:47:33,246 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:47:33,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:47:33,314 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:47:33,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33 WrapperNode [2024-11-10 18:47:33,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:47:33,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:47:33,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:47:33,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:47:33,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,358 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 340 [2024-11-10 18:47:33,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:47:33,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:47:33,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:47:33,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:47:33,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,398 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 54, 10]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 6, 5]. [2024-11-10 18:47:33,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:47:33,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:47:33,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:47:33,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:47:33,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (1/1) ... [2024-11-10 18:47:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:47:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:33,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:47:33,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:47:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:47:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:47:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-10 18:47:33,508 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-10 18:47:33,601 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:47:33,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:47:33,841 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L555: havoc containsBody_#t~mem29#1;havoc containsBody_#t~mem30#1.base, containsBody_#t~mem30#1.offset;havoc containsBody_#t~mem31#1;havoc containsBody_#t~short32#1;havoc containsBody_#t~mem33#1.base, containsBody_#t~mem33#1.offset;havoc containsBody_#t~mem34#1.base, containsBody_#t~mem34#1.offset;havoc containsBody_#t~mem35#1;havoc containsBody_#t~short36#1;havoc containsBody_#t~mem37#1.base, containsBody_#t~mem37#1.offset;havoc containsBody_#t~mem38#1.base, containsBody_#t~mem38#1.offset;havoc containsBody_#t~mem39#1.base, containsBody_#t~mem39#1.offset;havoc containsBody_#t~mem40#1;havoc containsBody_#t~short41#1;havoc containsBody_#t~mem42#1.base, containsBody_#t~mem42#1.offset;havoc containsBody_#t~mem43#1.base, containsBody_#t~mem43#1.offset;havoc containsBody_#t~mem44#1.base, containsBody_#t~mem44#1.offset;havoc containsBody_#t~mem45#1.base, containsBody_#t~mem45#1.offset;havoc containsBody_#t~mem46#1;havoc containsBody_#t~short47#1;havoc containsBody_#t~mem48#1.base, containsBody_#t~mem48#1.offset;havoc containsBody_#t~mem49#1.base, containsBody_#t~mem49#1.offset;havoc containsBody_#t~mem50#1.base, containsBody_#t~mem50#1.offset;havoc containsBody_#t~mem51#1.base, containsBody_#t~mem51#1.offset;havoc containsBody_#t~mem52#1.base, containsBody_#t~mem52#1.offset;havoc containsBody_#t~mem53#1;havoc containsBody_#t~short54#1; [2024-11-10 18:47:33,841 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L551: havoc containsHead_#t~mem3#1;havoc containsHead_#t~mem4#1.base, containsHead_#t~mem4#1.offset;havoc containsHead_#t~mem5#1;havoc containsHead_#t~short6#1;havoc containsHead_#t~mem7#1.base, containsHead_#t~mem7#1.offset;havoc containsHead_#t~mem8#1.base, containsHead_#t~mem8#1.offset;havoc containsHead_#t~mem9#1;havoc containsHead_#t~short10#1;havoc containsHead_#t~mem11#1.base, containsHead_#t~mem11#1.offset;havoc containsHead_#t~mem12#1.base, containsHead_#t~mem12#1.offset;havoc containsHead_#t~mem13#1.base, containsHead_#t~mem13#1.offset;havoc containsHead_#t~mem14#1;havoc containsHead_#t~short15#1;havoc containsHead_#t~mem16#1.base, containsHead_#t~mem16#1.offset;havoc containsHead_#t~mem17#1.base, containsHead_#t~mem17#1.offset;havoc containsHead_#t~mem18#1.base, containsHead_#t~mem18#1.offset;havoc containsHead_#t~mem19#1.base, containsHead_#t~mem19#1.offset;havoc containsHead_#t~mem20#1;havoc containsHead_#t~short21#1;havoc containsHead_#t~mem22#1.base, containsHead_#t~mem22#1.offset;havoc containsHead_#t~mem23#1.base, containsHead_#t~mem23#1.offset;havoc containsHead_#t~mem24#1.base, containsHead_#t~mem24#1.offset;havoc containsHead_#t~mem25#1.base, containsHead_#t~mem25#1.offset;havoc containsHead_#t~mem26#1.base, containsHead_#t~mem26#1.offset;havoc containsHead_#t~mem27#1;havoc containsHead_#t~short28#1; [2024-11-10 18:47:33,919 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-10 18:47:33,919 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:47:33,938 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:47:33,938 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:47:33,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:47:33 BoogieIcfgContainer [2024-11-10 18:47:33,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:47:33,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:47:33,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:47:33,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:47:33,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:47:32" (1/3) ... [2024-11-10 18:47:33,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67609577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:47:33, skipping insertion in model container [2024-11-10 18:47:33,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:47:33" (2/3) ... [2024-11-10 18:47:33,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67609577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:47:33, skipping insertion in model container [2024-11-10 18:47:33,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:47:33" (3/3) ... [2024-11-10 18:47:33,945 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2024-11-10 18:47:33,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:47:33,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 18:47:34,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:47:34,015 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;@45328e71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:47:34,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 18:47:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 71 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 18:47:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 18:47:34,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:34,027 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:47:34,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:34,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -299895384, now seen corresponding path program 1 times [2024-11-10 18:47:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530153015] [2024-11-10 18:47:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-10 18:47:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:47:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 18:47:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:47:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 18:47:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 18:47:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 18:47:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 18:47:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:47:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 18:47:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 18:47:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-10 18:47:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530153015] [2024-11-10 18:47:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530153015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:47:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:47:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517420304] [2024-11-10 18:47:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:47:34,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:47:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:47:34,867 INFO L87 Difference]: Start difference. First operand has 86 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 71 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 18:47:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:35,028 INFO L93 Difference]: Finished difference Result 170 states and 264 transitions. [2024-11-10 18:47:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:47:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-10 18:47:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:35,036 INFO L225 Difference]: With dead ends: 170 [2024-11-10 18:47:35,036 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 18:47:35,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:47:35,041 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:35,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:47:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 18:47:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 18:47:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 65 states have internal predecessors, (85), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 18:47:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-10 18:47:35,076 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 83 [2024-11-10 18:47:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-10 18:47:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-10 18:47:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-10 18:47:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 18:47:35,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:35,081 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:47:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:47:35,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash -667703946, now seen corresponding path program 1 times [2024-11-10 18:47:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082999953] [2024-11-10 18:47:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-10 18:47:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082999953] [2024-11-10 18:47:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082999953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957043951] [2024-11-10 18:47:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:36,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:36,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:47:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:37,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:47:37,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 18:47:37,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:47:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957043951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:47:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-10 18:47:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318091273] [2024-11-10 18:47:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:37,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:47:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:47:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:47:37,186 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:37,211 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2024-11-10 18:47:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:47:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-10 18:47:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:37,213 INFO L225 Difference]: With dead ends: 82 [2024-11-10 18:47:37,213 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 18:47:37,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:47:37,214 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:37,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:47:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 18:47:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-10 18:47:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.4) internal successors, (84), 64 states have internal predecessors, (84), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 18:47:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-11-10 18:47:37,221 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 125 [2024-11-10 18:47:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:37,223 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-11-10 18:47:37,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-11-10 18:47:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 18:47:37,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:37,224 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:47:37,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:47:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:37,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 776014170, now seen corresponding path program 1 times [2024-11-10 18:47:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457455932] [2024-11-10 18:47:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-11-10 18:47:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:38,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457455932] [2024-11-10 18:47:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457455932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026730440] [2024-11-10 18:47:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:38,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:38,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:38,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:47:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:38,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:47:38,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 18:47:39,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:47:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026730440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:39,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:47:39,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-10 18:47:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696746765] [2024-11-10 18:47:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:47:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:47:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:47:39,020 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:39,058 INFO L93 Difference]: Finished difference Result 108 states and 150 transitions. [2024-11-10 18:47:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:47:39,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-10 18:47:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:39,060 INFO L225 Difference]: With dead ends: 108 [2024-11-10 18:47:39,060 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 18:47:39,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:47:39,061 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:39,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 320 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:47:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 18:47:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-10 18:47:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.375) internal successors, (88), 68 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 18:47:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-11-10 18:47:39,075 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 126 [2024-11-10 18:47:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-11-10 18:47:39,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-11-10 18:47:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 18:47:39,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:39,077 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 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] [2024-11-10 18:47:39,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:47:39,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 18:47:39,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2005966606, now seen corresponding path program 1 times [2024-11-10 18:47:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890523716] [2024-11-10 18:47:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-10 18:47:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890523716] [2024-11-10 18:47:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890523716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223500264] [2024-11-10 18:47:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:40,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:40,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:40,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:47:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:40,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 1814 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:47:40,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 18:47:40,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:47:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 18:47:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223500264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:47:41,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:47:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-11-10 18:47:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861502015] [2024-11-10 18:47:41,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:47:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 18:47:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 18:47:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:47:41,059 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-10 18:47:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:41,921 INFO L93 Difference]: Finished difference Result 214 states and 354 transitions. [2024-11-10 18:47:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 18:47:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 131 [2024-11-10 18:47:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:41,924 INFO L225 Difference]: With dead ends: 214 [2024-11-10 18:47:41,924 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 18:47:41,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-10 18:47:41,926 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 27 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:41,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 965 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 18:47:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 18:47:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2024-11-10 18:47:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 93 states have internal predecessors, (116), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-10 18:47:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 191 transitions. [2024-11-10 18:47:41,946 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 191 transitions. Word has length 131 [2024-11-10 18:47:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 191 transitions. [2024-11-10 18:47:41,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 16 states have internal predecessors, (97), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-10 18:47:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-11-10 18:47:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 18:47:41,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:41,949 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:47:41,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:47:42,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:42,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:42,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1474668892, now seen corresponding path program 1 times [2024-11-10 18:47:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687031399] [2024-11-10 18:47:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:42,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2024-11-10 18:47:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:42,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687031399] [2024-11-10 18:47:42,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687031399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:42,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:47:42,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:47:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815979647] [2024-11-10 18:47:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:47:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:47:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:47:42,620 INFO L87 Difference]: Start difference. First operand 122 states and 191 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:42,680 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2024-11-10 18:47:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:47:42,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 151 [2024-11-10 18:47:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:42,685 INFO L225 Difference]: With dead ends: 129 [2024-11-10 18:47:42,685 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 18:47:42,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:47:42,686 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:42,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:47:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 18:47:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-10 18:47:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-10 18:47:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2024-11-10 18:47:42,704 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 151 [2024-11-10 18:47:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:42,706 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2024-11-10 18:47:42,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-11-10 18:47:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 18:47:42,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:42,711 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 3, 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] [2024-11-10 18:47:42,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:47:42,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:42,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 799186764, now seen corresponding path program 1 times [2024-11-10 18:47:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:42,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072873324] [2024-11-10 18:47:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:43,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072873324] [2024-11-10 18:47:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072873324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633168922] [2024-11-10 18:47:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:43,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:43,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:47:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:43,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:47:43,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:43,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:47:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633168922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:47:44,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:47:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-11-10 18:47:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290299970] [2024-11-10 18:47:44,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:47:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 18:47:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:44,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 18:47:44,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:47:44,004 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:44,096 INFO L93 Difference]: Finished difference Result 166 states and 244 transitions. [2024-11-10 18:47:44,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:47:44,096 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 156 [2024-11-10 18:47:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:44,098 INFO L225 Difference]: With dead ends: 166 [2024-11-10 18:47:44,098 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 18:47:44,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:47:44,099 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:44,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 700 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:47:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 18:47:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-10 18:47:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 112 states have internal predecessors, (135), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-10 18:47:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-11-10 18:47:44,110 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 156 [2024-11-10 18:47:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-11-10 18:47:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-11-10 18:47:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 18:47:44,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:44,112 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 5, 5, 5, 5, 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] [2024-11-10 18:47:44,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:47:44,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:44,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2018025692, now seen corresponding path program 2 times [2024-11-10 18:47:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868783208] [2024-11-10 18:47:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868783208] [2024-11-10 18:47:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868783208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000991886] [2024-11-10 18:47:44,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:47:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:44,987 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:47:45,961 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:47:45,961 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:47:45,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 18:47:45,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:46,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:47:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-11-10 18:47:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000991886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:47:46,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:47:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2024-11-10 18:47:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043860049] [2024-11-10 18:47:46,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:47:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:47:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:47:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:47:46,172 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:46,267 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-10 18:47:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:47:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 171 [2024-11-10 18:47:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:46,268 INFO L225 Difference]: With dead ends: 171 [2024-11-10 18:47:46,269 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 18:47:46,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 358 SyntacticMatches, 11 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:47:46,269 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:46,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 599 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:47:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 18:47:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-10 18:47:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 117 states have internal predecessors, (140), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-10 18:47:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 215 transitions. [2024-11-10 18:47:46,281 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 215 transitions. Word has length 171 [2024-11-10 18:47:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 215 transitions. [2024-11-10 18:47:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 215 transitions. [2024-11-10 18:47:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 18:47:46,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:46,283 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 7, 6, 6, 6, 6, 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] [2024-11-10 18:47:46,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:47:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:46,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1448275276, now seen corresponding path program 3 times [2024-11-10 18:47:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181593894] [2024-11-10 18:47:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 18:47:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181593894] [2024-11-10 18:47:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181593894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:47:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077242215] [2024-11-10 18:47:47,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:47:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:47,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:47:47,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:47:47,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:47:47,864 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 18:47:47,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:47:47,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:47:47,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:47:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 18:47:47,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:47:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077242215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:47:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 18:47:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328592902] [2024-11-10 18:47:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:47:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:47,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:47:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:47:47,906 INFO L87 Difference]: Start difference. First operand 146 states and 215 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:47,924 INFO L93 Difference]: Finished difference Result 146 states and 215 transitions. [2024-11-10 18:47:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:47:47,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 176 [2024-11-10 18:47:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:47,925 INFO L225 Difference]: With dead ends: 146 [2024-11-10 18:47:47,925 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 18:47:47,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:47:47,926 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:47,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:47:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 18:47:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 18:47:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 116 states have internal predecessors, (139), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-10 18:47:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 214 transitions. [2024-11-10 18:47:47,936 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 214 transitions. Word has length 176 [2024-11-10 18:47:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 214 transitions. [2024-11-10 18:47:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 214 transitions. [2024-11-10 18:47:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 18:47:47,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:47:47,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 7, 6, 6, 6, 6, 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] [2024-11-10 18:47:47,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:47:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:47:48,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 18:47:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:47:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1946860576, now seen corresponding path program 1 times [2024-11-10 18:47:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:47:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474507187] [2024-11-10 18:47:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:47:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:47:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 18:47:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:47:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 18:47:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:47:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-10 18:47:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:47:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 18:47:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 18:47:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 18:47:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 18:47:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 18:47:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:47:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 18:47:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 18:47:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 18:47:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:47:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-11-10 18:47:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:47:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474507187] [2024-11-10 18:47:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474507187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:47:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:47:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:47:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638579822] [2024-11-10 18:47:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:47:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:47:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:47:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:47:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:47:48,492 INFO L87 Difference]: Start difference. First operand 145 states and 214 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:47:48,547 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2024-11-10 18:47:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:47:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 177 [2024-11-10 18:47:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:47:48,548 INFO L225 Difference]: With dead ends: 145 [2024-11-10 18:47:48,548 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:47:48,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:47:48,549 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:47:48,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:47:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:47:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:47:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:47:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:47:48,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2024-11-10 18:47:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:47:48,550 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:47:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 18:47:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:47:48,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:47:48,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 18:47:48,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 18:47:48,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 18:47:48,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 18:47:48,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:47:48,556 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-10 18:47:48,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:47:48,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:47:48,664 WARN L156 FloydHoareUtils]: Requires clause for append contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-10 18:47:48,666 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-10 18:47:48,667 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2024-11-10 18:47:48,667 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] [2024-11-10 18:47:48,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-10 18:47:48,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-10 18:47:48,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] [2024-11-10 18:47:48,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:47:48 BoogieIcfgContainer [2024-11-10 18:47:48,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:47:48,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:47:48,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:47:48,671 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:47:48,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:47:33" (3/4) ... [2024-11-10 18:47:48,673 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:47:48,677 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure append [2024-11-10 18:47:48,681 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2024-11-10 18:47:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 18:47:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:47:48,682 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:47:48,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:47:48,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:47:48,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:47:48,766 INFO L158 Benchmark]: Toolchain (without parser) took 15859.27ms. Allocated memory was 163.6MB in the beginning and 673.2MB in the end (delta: 509.6MB). Free memory was 91.3MB in the beginning and 575.3MB in the end (delta: -484.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,766 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 163.6MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:47:48,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.64ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 126.3MB in the end (delta: -35.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.29ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 123.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,766 INFO L158 Benchmark]: Boogie Preprocessor took 55.81ms. Allocated memory is still 163.6MB. Free memory was 123.3MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,767 INFO L158 Benchmark]: IcfgBuilder took 522.44ms. Allocated memory is still 163.6MB. Free memory was 119.1MB in the beginning and 87.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,767 INFO L158 Benchmark]: TraceAbstraction took 14729.99ms. Allocated memory was 163.6MB in the beginning and 673.2MB in the end (delta: 509.6MB). Free memory was 86.5MB in the beginning and 583.7MB in the end (delta: -497.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,767 INFO L158 Benchmark]: Witness Printer took 94.53ms. Allocated memory is still 673.2MB. Free memory was 583.7MB in the beginning and 575.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 18:47:48,769 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 163.6MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.64ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 126.3MB in the end (delta: -35.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.29ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 123.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.81ms. Allocated memory is still 163.6MB. Free memory was 123.3MB in the beginning and 119.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 522.44ms. Allocated memory is still 163.6MB. Free memory was 119.1MB in the beginning and 87.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14729.99ms. Allocated memory was 163.6MB in the beginning and 673.2MB in the end (delta: 509.6MB). Free memory was 86.5MB in the beginning and 583.7MB in the end (delta: -497.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 94.53ms. Allocated memory is still 673.2MB. Free memory was 583.7MB in the beginning and 575.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 4185 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3223 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 944 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 962 mSDtfsCounter, 944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1655 GetRequests, 1565 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=7, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2181 NumberOfCodeBlocks, 2071 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2621 ConstructedInterpolants, 0 QuantifiedInterpolants, 6425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9831 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 9230/9772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 573]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 580]: Location Invariant Derived location invariant: null - InvariantResult [Line: 619]: Location Invariant Derived location invariant: null - InvariantResult [Line: 591]: Location Invariant Derived location invariant: null - InvariantResult [Line: 629]: Location Invariant Derived location invariant: null - InvariantResult [Line: 604]: Location Invariant Derived location invariant: null - InvariantResult [Line: 578]: Location Invariant Derived location invariant: null - InvariantResult [Line: 613]: Location Invariant Derived location invariant: null - InvariantResult [Line: 606]: Location Invariant Derived location invariant: null - InvariantResult [Line: 573]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:47:48,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE