./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:24:49,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:24:49,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:24:49,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:24:49,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:24:49,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:24:49,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:24:49,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:24:49,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:24:49,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:24:49,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:24:49,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:24:49,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:24:49,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:24:49,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:24:49,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:24:49,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:24:49,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:24:49,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:24:49,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:24:49,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:24:49,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:24:49,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:24:49,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:24:49,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:24:49,333 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:24:49,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:24:49,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:24:49,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:24:49,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:24:49,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:24:49,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:24:49,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:24:49,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:24:49,336 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-09 11:24:49,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:24:49,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:24:49,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:24:49,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:24:49,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:24:49,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-09 11:24:51,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:24:51,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:24:51,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-09 11:24:51,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b4734cc/40ed050387324c769a34ee88c50f2868/FLAG60fa258ab [2024-11-09 11:24:51,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b4734cc/40ed050387324c769a34ee88c50f2868 [2024-11-09 11:24:51,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:24:51,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:24:51,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:24:51,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:24:51,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:24:51,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:51" (1/1) ... [2024-11-09 11:24:51,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9f9cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:51, skipping insertion in model container [2024-11-09 11:24:51,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:51" (1/1) ... [2024-11-09 11:24:51,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:24:51,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:24:51,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:24:51,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:24:52,025 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:24:52,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52 WrapperNode [2024-11-09 11:24:52,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:24:52,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:24:52,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:24:52,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:24:52,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,074 INFO L138 Inliner]: procedures = 127, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2024-11-09 11:24:52,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:24:52,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:24:52,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:24:52,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:24:52,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,116 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-09 11:24:52,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:24:52,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:24:52,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:24:52,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:24:52,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (1/1) ... [2024-11-09 11:24:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:24:52,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:52,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:24:52,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:24:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 11:24:52,205 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 11:24:52,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 11:24:52,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:24:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 11:24:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 11:24:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 11:24:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:24:52,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:24:52,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:24:52,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:24:52,610 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-09 11:24:52,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:24:52,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:24:52,629 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 11:24:52,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:24:52 BoogieIcfgContainer [2024-11-09 11:24:52,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:24:52,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:24:52,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:24:52,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:24:52,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:24:51" (1/3) ... [2024-11-09 11:24:52,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e393393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:52, skipping insertion in model container [2024-11-09 11:24:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:52" (2/3) ... [2024-11-09 11:24:52,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e393393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:52, skipping insertion in model container [2024-11-09 11:24:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:24:52" (3/3) ... [2024-11-09 11:24:52,636 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-09 11:24:52,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:24:52,650 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-09 11:24:52,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:24:52,699 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;@52803c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:24:52,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 11:24:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 68 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 11:24:52,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:52,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:52,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash -580514597, now seen corresponding path program 1 times [2024-11-09 11:24:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355778036] [2024-11-09 11:24:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:24:53,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:53,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355778036] [2024-11-09 11:24:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355778036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510503557] [2024-11-09 11:24:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:53,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:53,101 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 68 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:53,190 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2024-11-09 11:24:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 11:24:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:53,198 INFO L225 Difference]: With dead ends: 137 [2024-11-09 11:24:53,199 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 11:24:53,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09 11:24:53,203 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:53,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 11:24:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-11-09 11:24:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-09 11:24:53,234 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 13 [2024-11-09 11:24:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:53,235 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-09 11:24:53,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:24:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-09 11:24:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:24:53,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:53,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:24:53,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1413448804, now seen corresponding path program 1 times [2024-11-09 11:24:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587634245] [2024-11-09 11:24:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:24:53,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587634245] [2024-11-09 11:24:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587634245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:53,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910457408] [2024-11-09 11:24:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:53,446 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:53,585 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-11-09 11:24:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:24:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:53,587 INFO L225 Difference]: With dead ends: 70 [2024-11-09 11:24:53,587 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 11:24:53,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 11:24:53,589 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:53,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 11:24:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 11:24:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:24:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-09 11:24:53,600 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 20 [2024-11-09 11:24:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:53,600 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-09 11:24:53,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-09 11:24:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 11:24:53,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:53,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:53,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:24:53,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:53,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1755335305, now seen corresponding path program 1 times [2024-11-09 11:24:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973809546] [2024-11-09 11:24:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 11:24:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973809546] [2024-11-09 11:24:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973809546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:53,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:24:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583063053] [2024-11-09 11:24:53,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:53,764 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:53,806 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-11-09 11:24:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-09 11:24:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:53,808 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:24:53,808 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 11:24:53,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 11:24:53,809 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 43 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:53,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 11:24:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 11:24:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 56 states have internal predecessors, (64), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:24:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-09 11:24:53,815 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2024-11-09 11:24:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:53,815 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-09 11:24:53,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:24:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-09 11:24:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:24:53,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:53,816 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:24:53,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -696047882, now seen corresponding path program 1 times [2024-11-09 11:24:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610765259] [2024-11-09 11:24:53,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:24:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:24:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610765259] [2024-11-09 11:24:53,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610765259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284278557] [2024-11-09 11:24:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:53,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:54,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:24:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:24:54,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:24:54,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284278557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:54,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-09 11:24:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835259835] [2024-11-09 11:24:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:54,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:24:54,197 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:54,219 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2024-11-09 11:24:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-09 11:24:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:54,225 INFO L225 Difference]: With dead ends: 105 [2024-11-09 11:24:54,226 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 11:24:54,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:24:54,227 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:54,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 11:24:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 11:24:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 49 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-09 11:24:54,232 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 32 [2024-11-09 11:24:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:54,232 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-09 11:24:54,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-09 11:24:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 11:24:54,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:54,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:54,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:24:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:54,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -941748301, now seen corresponding path program 1 times [2024-11-09 11:24:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256693159] [2024-11-09 11:24:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256693159] [2024-11-09 11:24:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256693159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:24:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209518514] [2024-11-09 11:24:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:54,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:54,651 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:54,717 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-09 11:24:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-09 11:24:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:54,718 INFO L225 Difference]: With dead ends: 54 [2024-11-09 11:24:54,719 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 11:24:54,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-09 11:24:54,719 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:54,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 11:24:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 11:24:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 48 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-11-09 11:24:54,724 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 35 [2024-11-09 11:24:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-09 11:24:54,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-11-09 11:24:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:24:54,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:54,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:54,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:24:54,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash 870573822, now seen corresponding path program 1 times [2024-11-09 11:24:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292560768] [2024-11-09 11:24:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:24:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292560768] [2024-11-09 11:24:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292560768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382237303] [2024-11-09 11:24:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:54,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:54,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:24:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:24:55,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:55,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382237303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:55,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-09 11:24:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120527205] [2024-11-09 11:24:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:55,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:24:55,226 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:55,237 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-11-09 11:24:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:55,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 11:24:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:55,238 INFO L225 Difference]: With dead ends: 53 [2024-11-09 11:24:55,238 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 11:24:55,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:24:55,239 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:55,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 11:24:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 11:24:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 47 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-09 11:24:55,243 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 36 [2024-11-09 11:24:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-09 11:24:55,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-09 11:24:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:24:55,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:55,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:55,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:24:55,444 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,SelfDestructingSolverStorable5 [2024-11-09 11:24:55,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2092031581, now seen corresponding path program 1 times [2024-11-09 11:24:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658865612] [2024-11-09 11:24:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:55,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:55,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658865612] [2024-11-09 11:24:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658865612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:55,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961183557] [2024-11-09 11:24:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:24:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:24:55,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:24:55,524 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:55,561 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-09 11:24:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:24:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-09 11:24:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:55,563 INFO L225 Difference]: With dead ends: 77 [2024-11-09 11:24:55,563 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 11:24:55,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-09 11:24:55,563 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:55,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 11:24:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 11:24:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-09 11:24:55,568 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 39 [2024-11-09 11:24:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-09 11:24:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-11-09 11:24:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:24:55,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:55,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:24:55,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1257023399, now seen corresponding path program 1 times [2024-11-09 11:24:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184718998] [2024-11-09 11:24:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:55,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184718998] [2024-11-09 11:24:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184718998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:55,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:55,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:24:55,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926712959] [2024-11-09 11:24:55,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:55,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:55,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:55,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:55,703 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:55,750 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-09 11:24:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 11:24:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:55,751 INFO L225 Difference]: With dead ends: 60 [2024-11-09 11:24:55,752 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 11:24:55,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-09 11:24:55,753 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:55,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 11:24:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 11:24:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.25) internal successors, (60), 53 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-09 11:24:55,762 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 41 [2024-11-09 11:24:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:55,762 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-09 11:24:55,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-11-09 11:24:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:24:55,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:55,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:55,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:24:55,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash -526585807, now seen corresponding path program 1 times [2024-11-09 11:24:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:55,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358338618] [2024-11-09 11:24:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:24:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358338618] [2024-11-09 11:24:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358338618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:24:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599585216] [2024-11-09 11:24:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:24:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:24:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:24:55,912 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:55,957 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2024-11-09 11:24:55,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:24:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-09 11:24:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:55,958 INFO L225 Difference]: With dead ends: 87 [2024-11-09 11:24:55,958 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 11:24:55,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:24:55,959 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:55,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 11:24:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 11:24:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 52 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-11-09 11:24:55,963 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 47 [2024-11-09 11:24:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-11-09 11:24:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:24:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-11-09 11:24:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 11:24:55,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:55,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:24:55,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -60886438, now seen corresponding path program 1 times [2024-11-09 11:24:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410430509] [2024-11-09 11:24:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410430509] [2024-11-09 11:24:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410430509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:24:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744809968] [2024-11-09 11:24:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:56,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:24:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:24:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:24:56,093 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:56,161 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-11-09 11:24:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:24:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 11:24:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:56,162 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:24:56,162 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 11:24:56,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:24:56,163 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:56,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 11:24:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-11-09 11:24:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-09 11:24:56,167 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 48 [2024-11-09 11:24:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:56,167 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-09 11:24:56,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-09 11:24:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 11:24:56,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:56,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:24:56,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:24:56,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:56,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -60846716, now seen corresponding path program 1 times [2024-11-09 11:24:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094755439] [2024-11-09 11:24:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094755439] [2024-11-09 11:24:56,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094755439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:56,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244087848] [2024-11-09 11:24:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:56,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:56,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:56,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:56,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:24:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:24:56,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:56,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244087848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-09 11:24:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950355544] [2024-11-09 11:24:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:56,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:24:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:24:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:56,519 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:56,553 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-09 11:24:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:24:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 11:24:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:56,554 INFO L225 Difference]: With dead ends: 62 [2024-11-09 11:24:56,554 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:24:56,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:56,554 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:56,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:24:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 11:24:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-09 11:24:56,558 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 48 [2024-11-09 11:24:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:56,558 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-09 11:24:56,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-09 11:24:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 11:24:56,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:56,559 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:56,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:24:56,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:56,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:56,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:56,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1887479447, now seen corresponding path program 1 times [2024-11-09 11:24:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:56,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673896688] [2024-11-09 11:24:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673896688] [2024-11-09 11:24:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673896688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:56,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:56,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:24:56,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672863254] [2024-11-09 11:24:56,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:24:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:24:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:24:56,899 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:56,962 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-11-09 11:24:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:24:56,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 11:24:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:56,963 INFO L225 Difference]: With dead ends: 65 [2024-11-09 11:24:56,963 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 11:24:56,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:24:56,964 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:56,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 222 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 11:24:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-11-09 11:24:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-09 11:24:56,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 49 [2024-11-09 11:24:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:56,967 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-09 11:24:56,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-09 11:24:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 11:24:56,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:56,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:24:56,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:24:56,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:56,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1886248085, now seen corresponding path program 1 times [2024-11-09 11:24:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539175331] [2024-11-09 11:24:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539175331] [2024-11-09 11:24:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539175331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714883717] [2024-11-09 11:24:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:57,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:57,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:24:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:24:57,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:57,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:24:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714883717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:24:57,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:24:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-09 11:24:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105009352] [2024-11-09 11:24:57,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:24:57,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:24:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:57,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:24:57,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:24:57,401 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:57,474 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2024-11-09 11:24:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:24:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 11:24:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:57,475 INFO L225 Difference]: With dead ends: 83 [2024-11-09 11:24:57,475 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 11:24:57,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:24:57,476 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:57,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 238 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 11:24:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-09 11:24:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-09 11:24:57,480 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 49 [2024-11-09 11:24:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-09 11:24:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-09 11:24:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 11:24:57,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:57,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:57,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:24:57,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:57,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:57,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash -188232128, now seen corresponding path program 1 times [2024-11-09 11:24:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525144868] [2024-11-09 11:24:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525144868] [2024-11-09 11:24:57,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525144868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:57,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:24:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020548732] [2024-11-09 11:24:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:24:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:57,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:24:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:57,832 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:57,923 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-09 11:24:57,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:24:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-09 11:24:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:57,924 INFO L225 Difference]: With dead ends: 85 [2024-11-09 11:24:57,924 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 11:24:57,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:57,925 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:57,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 336 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 11:24:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 11:24:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-09 11:24:57,929 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 52 [2024-11-09 11:24:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-09 11:24:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-09 11:24:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 11:24:57,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:57,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:24:57,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:24:57,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1540228528, now seen corresponding path program 1 times [2024-11-09 11:24:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50410224] [2024-11-09 11:24:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50410224] [2024-11-09 11:24:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50410224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:24:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:24:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212338792] [2024-11-09 11:24:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:24:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:24:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:58,084 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,179 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2024-11-09 11:24:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:24:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 11:24:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,180 INFO L225 Difference]: With dead ends: 89 [2024-11-09 11:24:58,180 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 11:24:58,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:24:58,181 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 11:24:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 11:24:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-09 11:24:58,185 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 53 [2024-11-09 11:24:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-09 11:24:58,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-09 11:24:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 11:24:58,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:24:58,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:24:58,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:58,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash -766428082, now seen corresponding path program 1 times [2024-11-09 11:24:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118798949] [2024-11-09 11:24:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118798949] [2024-11-09 11:24:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118798949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081281378] [2024-11-09 11:24:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:58,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:58,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:24:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:24:58,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:58,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:24:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081281378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:24:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:24:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2024-11-09 11:24:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160788903] [2024-11-09 11:24:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:24:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:24:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:24:58,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:24:58,612 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:58,655 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2024-11-09 11:24:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:24:58,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-09 11:24:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:58,656 INFO L225 Difference]: With dead ends: 90 [2024-11-09 11:24:58,656 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 11:24:58,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:24:58,656 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:58,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 204 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:24:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 11:24:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-09 11:24:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 82 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 11:24:58,660 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 54 [2024-11-09 11:24:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 11:24:58,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 11:24:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:24:58,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:58,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:24:58,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:24:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 11:24:58,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:58,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2010533365, now seen corresponding path program 1 times [2024-11-09 11:24:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668911016] [2024-11-09 11:24:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668911016] [2024-11-09 11:24:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668911016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073653211] [2024-11-09 11:24:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:59,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:59,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:59,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:24:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:24:59,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:24:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:59,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:24:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:59,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073653211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:24:59,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:24:59,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-09 11:24:59,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706627912] [2024-11-09 11:24:59,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:24:59,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:24:59,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:24:59,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:24:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:24:59,386 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:24:59,479 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2024-11-09 11:24:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:24:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 11:24:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:24:59,480 INFO L225 Difference]: With dead ends: 104 [2024-11-09 11:24:59,480 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 11:24:59,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:24:59,481 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:24:59,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 402 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:24:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 11:24:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-09 11:24:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:24:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-11-09 11:24:59,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 55 [2024-11-09 11:24:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:24:59,486 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-11-09 11:24:59,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:24:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-11-09 11:24:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 11:24:59,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:24:59,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:24:59,502 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-09 11:24:59,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 11:24:59,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:24:59,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:24:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1814299084, now seen corresponding path program 1 times [2024-11-09 11:24:59,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:24:59,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95688883] [2024-11-09 11:24:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:24:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:24:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:24:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:24:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:24:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:24:59,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:24:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95688883] [2024-11-09 11:24:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95688883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:24:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533381821] [2024-11-09 11:24:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:24:59,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:24:59,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:24:59,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:24:59,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:25:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:25:00,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:00,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:25:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533381821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:25:00,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:25:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 12 [2024-11-09 11:25:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944206968] [2024-11-09 11:25:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:25:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:25:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:00,141 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:00,193 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-11-09 11:25:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:25:00,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-09 11:25:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:00,194 INFO L225 Difference]: With dead ends: 93 [2024-11-09 11:25:00,194 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 11:25:00,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:25:00,195 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:00,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 258 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:25:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 11:25:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-11-09 11:25:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 81 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-11-09 11:25:00,199 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 58 [2024-11-09 11:25:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-11-09 11:25:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-11-09 11:25:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 11:25:00,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:00,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 11:25:00,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:25:00,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:00,402 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:00,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1525932924, now seen corresponding path program 1 times [2024-11-09 11:25:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127601077] [2024-11-09 11:25:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127601077] [2024-11-09 11:25:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127601077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677687299] [2024-11-09 11:25:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:00,581 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:00,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:25:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:00,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:25:00,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:00,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677687299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:00,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-11-09 11:25:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616641469] [2024-11-09 11:25:00,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:00,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 11:25:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:00,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 11:25:00,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:25:00,988 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:01,085 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2024-11-09 11:25:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 11:25:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2024-11-09 11:25:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:01,086 INFO L225 Difference]: With dead ends: 111 [2024-11-09 11:25:01,086 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 11:25:01,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:25:01,087 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:01,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 11:25:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-11-09 11:25:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.118811881188119) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2024-11-09 11:25:01,090 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 59 [2024-11-09 11:25:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2024-11-09 11:25:01,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2024-11-09 11:25:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:25:01,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:01,091 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 11:25:01,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:25:01,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:01,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1139506792, now seen corresponding path program 1 times [2024-11-09 11:25:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52598074] [2024-11-09 11:25:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52598074] [2024-11-09 11:25:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52598074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552629577] [2024-11-09 11:25:01,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:01,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:01,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:01,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:01,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:25:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:01,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:25:01,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:01,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552629577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:01,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-09 11:25:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25581567] [2024-11-09 11:25:01,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:01,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 11:25:01,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 11:25:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:25:01,891 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 24 states have internal predecessors, (84), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:02,059 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2024-11-09 11:25:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 11:25:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 24 states have internal predecessors, (84), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2024-11-09 11:25:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:02,061 INFO L225 Difference]: With dead ends: 157 [2024-11-09 11:25:02,061 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 11:25:02,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:25:02,062 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:02,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 434 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 11:25:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2024-11-09 11:25:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 115 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2024-11-09 11:25:02,069 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 65 [2024-11-09 11:25:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:02,069 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2024-11-09 11:25:02,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 24 states have internal predecessors, (84), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2024-11-09 11:25:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 11:25:02,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:02,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:02,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:25:02,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:02,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1632213044, now seen corresponding path program 1 times [2024-11-09 11:25:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2952600] [2024-11-09 11:25:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2952600] [2024-11-09 11:25:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2952600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100262415] [2024-11-09 11:25:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:02,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:02,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:02,676 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:02,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:25:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:02,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 11:25:02,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:03,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100262415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:03,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2024-11-09 11:25:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520106834] [2024-11-09 11:25:03,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 11:25:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 11:25:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:25:03,177 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 29 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:03,300 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2024-11-09 11:25:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 11:25:03,301 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2024-11-09 11:25:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:03,302 INFO L225 Difference]: With dead ends: 179 [2024-11-09 11:25:03,302 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 11:25:03,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:25:03,302 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:03,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 642 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 11:25:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2024-11-09 11:25:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.112) internal successors, (139), 127 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2024-11-09 11:25:03,307 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 71 [2024-11-09 11:25:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:03,307 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2024-11-09 11:25:03,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 28 states have internal predecessors, (96), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2024-11-09 11:25:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 11:25:03,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:03,308 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:03,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:25:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 11:25:03,512 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -962170841, now seen corresponding path program 2 times [2024-11-09 11:25:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378152328] [2024-11-09 11:25:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:03,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:03,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378152328] [2024-11-09 11:25:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378152328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381280465] [2024-11-09 11:25:03,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:03,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:03,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:03,747 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:03,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:25:04,036 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:04,036 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:04,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:25:04,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:04,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381280465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:04,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2024-11-09 11:25:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266229910] [2024-11-09 11:25:04,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:04,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 11:25:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 11:25:04,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:25:04,303 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 33 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:04,414 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2024-11-09 11:25:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 11:25:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 79 [2024-11-09 11:25:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:04,416 INFO L225 Difference]: With dead ends: 199 [2024-11-09 11:25:04,416 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 11:25:04,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:25:04,417 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:04,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 390 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 11:25:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-11-09 11:25:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 171 states have (on average 1.1228070175438596) internal successors, (192), 173 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2024-11-09 11:25:04,425 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 79 [2024-11-09 11:25:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:04,425 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2024-11-09 11:25:04,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5) internal successors, (112), 32 states have internal predecessors, (112), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2024-11-09 11:25:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 11:25:04,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:04,427 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 11:25:04,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 11:25:04,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1660973292, now seen corresponding path program 2 times [2024-11-09 11:25:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359461615] [2024-11-09 11:25:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359461615] [2024-11-09 11:25:05,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359461615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:05,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785065177] [2024-11-09 11:25:05,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:05,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:05,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:05,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 11:25:05,421 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:05,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:05,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:25:05,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:05,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785065177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:05,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 36 [2024-11-09 11:25:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330830376] [2024-11-09 11:25:05,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 11:25:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 11:25:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 11:25:05,810 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 37 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:05,989 INFO L93 Difference]: Finished difference Result 253 states and 277 transitions. [2024-11-09 11:25:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 11:25:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 83 [2024-11-09 11:25:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:05,991 INFO L225 Difference]: With dead ends: 253 [2024-11-09 11:25:05,991 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 11:25:05,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 11:25:05,993 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 31 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:05,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 547 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 11:25:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 186. [2024-11-09 11:25:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.1173184357541899) internal successors, (200), 181 states have internal predecessors, (200), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2024-11-09 11:25:06,002 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 83 [2024-11-09 11:25:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:06,003 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2024-11-09 11:25:06,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2024-11-09 11:25:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 11:25:06,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:06,004 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:06,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 11:25:06,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 11:25:06,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:06,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1117068721, now seen corresponding path program 2 times [2024-11-09 11:25:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:06,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625854103] [2024-11-09 11:25:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:06,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625854103] [2024-11-09 11:25:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625854103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963129742] [2024-11-09 11:25:06,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:06,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:06,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 11:25:06,959 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:06,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:06,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:25:06,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:07,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963129742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:07,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 36 [2024-11-09 11:25:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576831321] [2024-11-09 11:25:07,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:07,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 11:25:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:07,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 11:25:07,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 11:25:07,383 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 36 states have internal predecessors, (124), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:07,562 INFO L93 Difference]: Finished difference Result 223 states and 245 transitions. [2024-11-09 11:25:07,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 11:25:07,563 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 36 states have internal predecessors, (124), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-11-09 11:25:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:07,564 INFO L225 Difference]: With dead ends: 223 [2024-11-09 11:25:07,564 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 11:25:07,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 11:25:07,567 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:07,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 423 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 11:25:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 192. [2024-11-09 11:25:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 185 states have (on average 1.1189189189189188) internal successors, (207), 187 states have internal predecessors, (207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2024-11-09 11:25:07,584 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 85 [2024-11-09 11:25:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2024-11-09 11:25:07,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4444444444444446) internal successors, (124), 36 states have internal predecessors, (124), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2024-11-09 11:25:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 11:25:07,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:07,586 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:07,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 11:25:07,790 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1833149800, now seen corresponding path program 2 times [2024-11-09 11:25:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159312361] [2024-11-09 11:25:07,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159312361] [2024-11-09 11:25:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159312361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286078313] [2024-11-09 11:25:08,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:08,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:08,221 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:08,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 11:25:08,651 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:08,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:08,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 11:25:08,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:08,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286078313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:09,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 40 [2024-11-09 11:25:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591094544] [2024-11-09 11:25:09,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:09,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 11:25:09,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 11:25:09,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:25:09,136 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 41 states, 40 states have (on average 3.3) internal successors, (132), 40 states have internal predecessors, (132), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:09,321 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2024-11-09 11:25:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 11:25:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.3) internal successors, (132), 40 states have internal predecessors, (132), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-09 11:25:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:09,323 INFO L225 Difference]: With dead ends: 241 [2024-11-09 11:25:09,323 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 11:25:09,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:25:09,324 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 63 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:09,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 446 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:25:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 11:25:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2024-11-09 11:25:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 189 states have (on average 1.1164021164021165) internal successors, (211), 191 states have internal predecessors, (211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2024-11-09 11:25:09,333 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 89 [2024-11-09 11:25:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:09,334 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2024-11-09 11:25:09,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.3) internal successors, (132), 40 states have internal predecessors, (132), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2024-11-09 11:25:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:25:09,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:09,335 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:09,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 11:25:09,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:09,540 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1916244572, now seen corresponding path program 3 times [2024-11-09 11:25:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809087202] [2024-11-09 11:25:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809087202] [2024-11-09 11:25:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809087202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944114740] [2024-11-09 11:25:09,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:25:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:09,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:09,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:09,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 11:25:12,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 11:25:12,055 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:12,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 11:25:12,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 11:25:12,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 11:25:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944114740] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:25:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [22, 8] total 34 [2024-11-09 11:25:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628570140] [2024-11-09 11:25:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:25:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:25:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:25:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:25:12,504 INFO L87 Difference]: Start difference. First operand 196 states and 217 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:12,694 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2024-11-09 11:25:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:25:12,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 95 [2024-11-09 11:25:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:12,695 INFO L225 Difference]: With dead ends: 253 [2024-11-09 11:25:12,695 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 11:25:12,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 11:25:12,696 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:12,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 11:25:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 11:25:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-11-09 11:25:12,718 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 95 [2024-11-09 11:25:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:12,718 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-11-09 11:25:12,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:25:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-11-09 11:25:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 11:25:12,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:12,719 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:12,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 11:25:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 11:25:12,920 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 511403952, now seen corresponding path program 2 times [2024-11-09 11:25:12,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:12,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55443494] [2024-11-09 11:25:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55443494] [2024-11-09 11:25:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55443494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032856813] [2024-11-09 11:25:13,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:25:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:13,612 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:13,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 11:25:13,962 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:25:13,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:13,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:25:13,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:14,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032856813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:25:14,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:25:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2024-11-09 11:25:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767623388] [2024-11-09 11:25:14,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:25:14,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 11:25:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:25:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 11:25:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 11:25:14,498 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 49 states, 48 states have (on average 3.25) internal successors, (156), 48 states have internal predecessors, (156), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:25:14,633 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2024-11-09 11:25:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 11:25:14,633 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.25) internal successors, (156), 48 states have internal predecessors, (156), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 101 [2024-11-09 11:25:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:25:14,634 INFO L225 Difference]: With dead ends: 155 [2024-11-09 11:25:14,634 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 11:25:14,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 11:25:14,635 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:25:14,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 631 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:25:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 11:25:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 11:25:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:25:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2024-11-09 11:25:14,641 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 101 [2024-11-09 11:25:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:25:14,642 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2024-11-09 11:25:14,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.25) internal successors, (156), 48 states have internal predecessors, (156), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:25:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2024-11-09 11:25:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 11:25:14,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:25:14,643 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:25:14,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 11:25:14,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 11:25:14,847 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-09 11:25:14,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:25:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1335773592, now seen corresponding path program 3 times [2024-11-09 11:25:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:25:14,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594341837] [2024-11-09 11:25:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:25:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:25:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:25:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 11:25:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 11:25:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:25:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 11:25:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:25:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594341837] [2024-11-09 11:25:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594341837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:25:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486909007] [2024-11-09 11:25:16,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:25:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:25:16,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:25:16,247 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:25:16,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 11:25:18,765 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 11:25:18,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:25:18,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-09 11:25:18,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:25:18,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 11:25:19,122 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 11:25:19,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 11:25:19,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 11:25:19,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 11:25:19,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 11:25:19,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 11:25:19,475 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 11:25:19,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 61 [2024-11-09 11:25:19,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2024-11-09 11:25:19,789 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 11:25:19,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 34 [2024-11-09 11:25:19,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 11:25:19,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2024-11-09 11:25:20,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 11:25:20,047 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 11:25:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 62 [2024-11-09 11:25:20,060 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 11:25:20,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 11:25:20,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-11-09 11:25:20,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 77 [2024-11-09 11:25:20,709 INFO L349 Elim1Store]: treesize reduction 162, result has 19.0 percent of original size [2024-11-09 11:25:20,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 303 treesize of output 107 [2024-11-09 11:25:21,528 INFO L349 Elim1Store]: treesize reduction 57, result has 21.9 percent of original size [2024-11-09 11:25:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 161 treesize of output 81 [2024-11-09 11:25:21,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2024-11-09 11:25:21,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 11:25:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 113 proven. 10 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-11-09 11:25:21,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:25:26,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse9 (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (.cse6 (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse16 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5347 Int) (v_ArrVal_5341 Int)) (= (let ((.cse3 (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse10 .cse8 v_ArrVal_5347))) (.cse0 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_5341)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse4)) (forall ((v_ArrVal_5347 Int) (v_ArrVal_5341 Int)) (= (let ((.cse11 (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse10 .cse8 v_ArrVal_5347))) (.cse12 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_5341)))) (let ((.cse13 (select (select .cse12 .cse4) .cse5)) (.cse14 (select (select .cse11 .cse4) .cse5))) (select (select .cse11 (select (select .cse12 .cse13) .cse14)) (select (select .cse11 .cse13) .cse14)))) .cse5)))))) is different from false