./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c -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 ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:36:14,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:36:14,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:36:14,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:36:14,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:36:14,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:36:14,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:36:14,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:36:14,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:36:14,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:36:14,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:36:14,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:36:14,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:36:14,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:36:14,379 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:36:14,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:36:14,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:36:14,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:36:14,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:36:14,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:36:14,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:36:14,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:36:14,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:36:14,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:36:14,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:36:14,387 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:36:14,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:36:14,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:36:14,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:36:14,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:14,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:36:14,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:36:14,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:36:14,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:36:14,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:36:14,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:36:14,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:36:14,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:36:14,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:36:14,391 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 -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca [2024-10-14 20:36:14,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:36:14,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:36:14,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:36:14,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:36:14,598 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:36:14,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-10-14 20:36:15,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:36:15,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:36:15,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-10-14 20:36:15,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b862590c/1b87357c48fb41c3bef39c2029548305/FLAG5c01c65ba [2024-10-14 20:36:15,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b862590c/1b87357c48fb41c3bef39c2029548305 [2024-10-14 20:36:15,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:36:15,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:36:15,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:15,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:36:15,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:36:15,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:15" (1/1) ... [2024-10-14 20:36:15,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bb1dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:15, skipping insertion in model container [2024-10-14 20:36:15,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:15" (1/1) ... [2024-10-14 20:36:15,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:36:16,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:16,101 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:36:16,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:16,137 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:36:16,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16 WrapperNode [2024-10-14 20:36:16,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:16,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:16,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:36:16,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:36:16,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,172 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-14 20:36:16,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:16,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:36:16,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:36:16,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:36:16,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,206 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 20:36:16,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:36:16,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:36:16,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:36:16,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:36:16,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (1/1) ... [2024-10-14 20:36:16,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:16,253 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-10-14 20:36:16,255 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-10-14 20:36:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:36:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:36:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:36:16,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:36:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:36:16,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:36:16,347 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:36:16,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:36:16,495 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 20:36:16,496 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:36:16,520 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:36:16,521 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:36:16,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:16 BoogieIcfgContainer [2024-10-14 20:36:16,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:36:16,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:36:16,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:36:16,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:36:16,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:36:15" (1/3) ... [2024-10-14 20:36:16,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268d2e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:16, skipping insertion in model container [2024-10-14 20:36:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:16" (2/3) ... [2024-10-14 20:36:16,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268d2e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:16, skipping insertion in model container [2024-10-14 20:36:16,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:16" (3/3) ... [2024-10-14 20:36:16,529 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2024-10-14 20:36:16,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:36:16,541 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 20:36:16,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:36:16,593 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;@3e53cce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:36:16,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 20:36:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:36:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:16,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:16,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:16,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-14 20:36:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505416112] [2024-10-14 20:36:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:16,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505416112] [2024-10-14 20:36:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505416112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272808929] [2024-10-14 20:36:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:16,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:36:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:36:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:16,745 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:16,780 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-14 20:36:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:36:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:36:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:16,788 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:16,788 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:36:16,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:16,794 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:16,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:36:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 20:36:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 20:36:16,860 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-14 20:36:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:16,861 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 20:36:16,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 20:36:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:16,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:16,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:16,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:36:16,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-14 20:36:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991577849] [2024-10-14 20:36:16,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:16,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991577849] [2024-10-14 20:36:16,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991577849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:16,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:16,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:16,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668710401] [2024-10-14 20:36:16,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:16,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:36:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:16,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:36:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:36:16,995 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:17,030 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-14 20:36:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:17,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:36:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:17,032 INFO L225 Difference]: With dead ends: 52 [2024-10-14 20:36:17,032 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:36:17,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:36:17,033 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:17,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:36:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 20:36:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-14 20:36:17,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-14 20:36:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:17,039 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-14 20:36:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-14 20:36:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:17,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:17,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:17,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:36:17,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-14 20:36:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905176889] [2024-10-14 20:36:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:17,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:17,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905176889] [2024-10-14 20:36:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905176889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:17,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814120241] [2024-10-14 20:36:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:17,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:17,170 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:18,368 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-14 20:36:18,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:36:18,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:36:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:18,369 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:18,369 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:18,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:18,371 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:18,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 20:36:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-14 20:36:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-14 20:36:18,379 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-14 20:36:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-14 20:36:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-14 20:36:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:18,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:18,380 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:36:18,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-14 20:36:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090418859] [2024-10-14 20:36:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090418859] [2024-10-14 20:36:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090418859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917761757] [2024-10-14 20:36:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:18,455 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-10-14 20:36:18,456 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-10-14 20:36:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:18,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:18,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:18,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917761757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:18,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107911161] [2024-10-14 20:36:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:18,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:18,572 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:18,605 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-14 20:36:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:36:18,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:36:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:18,607 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:18,607 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:18,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:36:18,608 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:18,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-14 20:36:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-14 20:36:18,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-14 20:36:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:18,620 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-14 20:36:18,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-14 20:36:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:18,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:18,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:18,639 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-10-14 20:36:18,822 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-10-14 20:36:18,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:18,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-14 20:36:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:18,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813524074] [2024-10-14 20:36:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813524074] [2024-10-14 20:36:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813524074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130667875] [2024-10-14 20:36:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:18,897 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:18,956 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-14 20:36:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:36:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 20:36:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:18,958 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:18,958 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:18,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:18,959 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:18,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-14 20:36:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-14 20:36:18,966 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-14 20:36:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-14 20:36:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-14 20:36:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:18,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:18,967 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:36:18,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:18,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-14 20:36:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127398368] [2024-10-14 20:36:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127398368] [2024-10-14 20:36:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127398368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217796988] [2024-10-14 20:36:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:19,060 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-10-14 20:36:19,061 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-10-14 20:36:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:19,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:19,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217796988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081107436] [2024-10-14 20:36:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:19,126 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:19,170 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-14 20:36:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 20:36:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:19,173 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:19,173 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:19,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:36:19,174 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:19,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-14 20:36:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-14 20:36:19,187 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-14 20:36:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:19,187 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-14 20:36:19,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-14 20:36:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:36:19,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:19,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:19,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:36:19,390 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-10-14 20:36:19,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-14 20:36:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936990930] [2024-10-14 20:36:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936990930] [2024-10-14 20:36:19,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936990930] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:19,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718125643] [2024-10-14 20:36:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:19,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:19,463 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-10-14 20:36:19,465 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-10-14 20:36:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:19,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:36:19,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718125643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:19,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-10-14 20:36:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396994983] [2024-10-14 20:36:19,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:36:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:36:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:19,604 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:19,647 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-10-14 20:36:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:36:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 20:36:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:19,651 INFO L225 Difference]: With dead ends: 72 [2024-10-14 20:36:19,651 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 20:36:19,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:36:19,652 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:19,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 20:36:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 20:36:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-14 20:36:19,662 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2024-10-14 20:36:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:19,662 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-14 20:36:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-14 20:36:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:36:19,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:19,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:19,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 20:36:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:19,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:19,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-14 20:36:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182724234] [2024-10-14 20:36:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182724234] [2024-10-14 20:36:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182724234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87253855] [2024-10-14 20:36:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:19,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:19,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:19,971 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-10-14 20:36:19,972 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-10-14 20:36:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:20,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:20,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:20,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87253855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-14 20:36:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536253459] [2024-10-14 20:36:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:20,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:36:20,063 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:20,124 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-10-14 20:36:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:36:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:20,125 INFO L225 Difference]: With dead ends: 54 [2024-10-14 20:36:20,125 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 20:36:20,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:36:20,126 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:20,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 20:36:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2024-10-14 20:36:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-10-14 20:36:20,135 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 15 [2024-10-14 20:36:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:20,135 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-14 20:36:20,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-10-14 20:36:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:36:20,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:20,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:20,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 20:36:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:20,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-14 20:36:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700247895] [2024-10-14 20:36:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700247895] [2024-10-14 20:36:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700247895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366348622] [2024-10-14 20:36:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:20,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:20,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:20,411 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-10-14 20:36:20,413 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-10-14 20:36:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:20,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:20,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:20,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:20,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366348622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:20,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:20,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-10-14 20:36:20,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292136377] [2024-10-14 20:36:20,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 20:36:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 20:36:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:36:20,574 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:21,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:21,960 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2024-10-14 20:36:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 20:36:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:36:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:21,961 INFO L225 Difference]: With dead ends: 73 [2024-10-14 20:36:21,961 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 20:36:21,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-10-14 20:36:21,962 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 103 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:21,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 159 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 20:36:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 20:36:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-10-14 20:36:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:36:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-10-14 20:36:21,979 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 16 [2024-10-14 20:36:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:21,979 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-10-14 20:36:21,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-10-14 20:36:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 20:36:21,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:21,982 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:36:21,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 20:36:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:22,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:22,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -991186133, now seen corresponding path program 1 times [2024-10-14 20:36:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:22,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287530008] [2024-10-14 20:36:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 20:36:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:36:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 20:36:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:36:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 20:36:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:36:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:36:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:36:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 20:36:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 20:36:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 20:36:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 20:36:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-10-14 20:36:22,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:22,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287530008] [2024-10-14 20:36:22,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287530008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:22,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48781246] [2024-10-14 20:36:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:22,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:36:22,302 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 20:36:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:22,335 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2024-10-14 20:36:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2024-10-14 20:36:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:22,336 INFO L225 Difference]: With dead ends: 105 [2024-10-14 20:36:22,336 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 20:36:22,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-10-14 20:36:22,339 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 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-10-14 20:36:22,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 20:36:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2024-10-14 20:36:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:36:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-10-14 20:36:22,350 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 92 [2024-10-14 20:36:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-10-14 20:36:22,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 20:36:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-10-14 20:36:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 20:36:22,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:22,353 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:22,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:36:22,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:22,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1136362409, now seen corresponding path program 1 times [2024-10-14 20:36:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005218569] [2024-10-14 20:36:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:22,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 20:36:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 20:36:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:36:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:36:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:36:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:36:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 20:36:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 20:36:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 20:36:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:36:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:36:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:36:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 20:36:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 20:36:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 20:36:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 20:36:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 20:36:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 20:36:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2024-10-14 20:36:22,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005218569] [2024-10-14 20:36:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005218569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046131753] [2024-10-14 20:36:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:22,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:22,649 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-10-14 20:36:22,650 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-10-14 20:36:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:22,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:36:22,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 321 proven. 1 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-10-14 20:36:22,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2024-10-14 20:36:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046131753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:22,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:22,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2024-10-14 20:36:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208273760] [2024-10-14 20:36:22,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:22,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 20:36:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:22,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 20:36:22,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:36:22,920 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 20:36:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:23,013 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-10-14 20:36:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:36:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 119 [2024-10-14 20:36:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:23,014 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:23,014 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:36:23,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 266 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:36:23,015 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:23,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:36:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:36:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:36:23,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2024-10-14 20:36:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:23,017 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:36:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 20:36:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:36:23,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:36:23,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 20:36:23,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 20:36:23,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 20:36:23,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 20:36:23,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 20:36:23,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:23,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:23,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:36:23,288 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:36:23,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:36:23 BoogieIcfgContainer [2024-10-14 20:36:23,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:36:23,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:36:23,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:36:23,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:36:23,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:16" (3/4) ... [2024-10-14 20:36:23,305 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:36:23,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:36:23,310 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 20:36:23,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:36:23,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:36:23,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:36:23,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:36:23,382 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:36:23,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:36:23,383 INFO L158 Benchmark]: Toolchain (without parser) took 7441.85ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 107.2MB in the beginning and 106.5MB in the end (delta: 685.2kB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,383 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 132.8MB in the end (delta: 11.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:36:23,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.99ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 94.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,384 INFO L158 Benchmark]: Boogie Preprocessor took 48.17ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,384 INFO L158 Benchmark]: RCFGBuilder took 297.89ms. Allocated memory is still 176.2MB. Free memory was 90.9MB in the beginning and 134.3MB in the end (delta: -43.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,384 INFO L158 Benchmark]: TraceAbstraction took 6779.38ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 133.7MB in the beginning and 111.7MB in the end (delta: 21.9MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,384 INFO L158 Benchmark]: Witness Printer took 79.26ms. Allocated memory is still 260.0MB. Free memory was 111.7MB in the beginning and 106.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:36:23,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 132.8MB in the end (delta: 11.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.99ms. Allocated memory is still 176.2MB. Free memory was 107.0MB in the beginning and 94.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 92.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.17ms. Allocated memory is still 176.2MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.89ms. Allocated memory is still 176.2MB. Free memory was 90.9MB in the beginning and 134.3MB in the end (delta: -43.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6779.38ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 133.7MB in the beginning and 111.7MB in the end (delta: 21.9MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Witness Printer took 79.26ms. Allocated memory is still 260.0MB. Free memory was 111.7MB in the beginning and 106.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 309 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 360 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=9, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 1178 SizeOfPredicates, 18 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 2280/2313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 2)) || (counter == 0)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:36:23,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE