./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-nla/hard2-both-nt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-nla/hard2-both-nt.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 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:45:30,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:45:30,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:45:30,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:45:30,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:45:30,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:45:30,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:45:30,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:45:30,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:45:30,385 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:45:30,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:45:30,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:45:30,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:45:30,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:45:30,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:45:30,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:45:30,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:45:30,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:45:30,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:45:30,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:45:30,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:45:30,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:45:30,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:45:30,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:45:30,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:45:30,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:45:30,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:45:30,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:45:30,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:45:30,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:45:30,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:45:30,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:45:30,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:45:30,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:45:30,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:45:30,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:45:30,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:45:30,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:45:30,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:45:30,394 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 -> 23ac641bc90237de255e915a5ed362430f6ac59f0f6642be7f9d8479ff0a7576 [2024-11-10 18:45:30,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:45:30,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:45:30,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:45:30,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:45:30,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:45:30,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-nla/hard2-both-nt.c [2024-11-10 18:45:31,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:45:31,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:45:31,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-nla/hard2-both-nt.c [2024-11-10 18:45:31,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ab73f45/fa049f267d284f0ea5527741ebeee568/FLAGd8c628d2a [2024-11-10 18:45:32,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ab73f45/fa049f267d284f0ea5527741ebeee568 [2024-11-10 18:45:32,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:45:32,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:45:32,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:45:32,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:45:32,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:45:32,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c284942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32, skipping insertion in model container [2024-11-10 18:45:32,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:45:32,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:45:32,550 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:45:32,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:45:32,573 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:45:32,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32 WrapperNode [2024-11-10 18:45:32,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:45:32,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:45:32,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:45:32,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:45:32,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,599 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-10 18:45:32,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:45:32,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:45:32,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:45:32,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:45:32,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,613 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-10 18:45:32,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:45:32,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:45:32,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:45:32,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:45:32,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (1/1) ... [2024-11-10 18:45:32,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:45:32,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:32,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:45:32,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:45:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:45:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:45:32,732 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:45:32,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:45:32,909 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-10 18:45:32,909 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:45:32,918 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:45:32,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:45:32,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:32 BoogieIcfgContainer [2024-11-10 18:45:32,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:45:32,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:45:32,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:45:32,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:45:32,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:45:32" (1/3) ... [2024-11-10 18:45:32,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faeb2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:32, skipping insertion in model container [2024-11-10 18:45:32,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:32" (2/3) ... [2024-11-10 18:45:32,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2faeb2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:32, skipping insertion in model container [2024-11-10 18:45:32,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:32" (3/3) ... [2024-11-10 18:45:32,924 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2-both-nt.c [2024-11-10 18:45:32,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:45:32,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-10 18:45:32,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:45:32,992 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;@62cf0280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:45:32,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-10 18:45:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 18:45:33,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:33,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:45:33,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:33,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 85854647, now seen corresponding path program 1 times [2024-11-10 18:45:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209611618] [2024-11-10 18:45:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693466619] [2024-11-10 18:45:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:33,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:33,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:45:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:33,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:33,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:33,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209611618] [2024-11-10 18:45:33,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693466619] [2024-11-10 18:45:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693466619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:33,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100996035] [2024-11-10 18:45:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,205 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 54 states have internal predecessors, (61), 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) Second operand has 3 states, 2 states have (on average 2.5) 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-11-10 18:45:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:33,290 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2024-11-10 18:45:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:33,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-11-10 18:45:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:33,297 INFO L225 Difference]: With dead ends: 123 [2024-11-10 18:45:33,298 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 18:45:33,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,302 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:33,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 18:45:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-10 18:45:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-11-10 18:45:33,325 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 5 [2024-11-10 18:45:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:33,325 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-11-10 18:45:33,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-11-10 18:45:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-11-10 18:45:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:45:33,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:33,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:33,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:45:33,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-10 18:45:33,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:33,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2104698821, now seen corresponding path program 1 times [2024-11-10 18:45:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441969916] [2024-11-10 18:45:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:33,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441969916] [2024-11-10 18:45:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441969916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144336828] [2024-11-10 18:45:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:33,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,607 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:33,650 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-10 18:45:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 18:45:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:33,653 INFO L225 Difference]: With dead ends: 81 [2024-11-10 18:45:33,653 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 18:45:33,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,655 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:33,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 78 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 18:45:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-10 18:45:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-10 18:45:33,664 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 8 [2024-11-10 18:45:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:33,665 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-10 18:45:33,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-10 18:45:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:45:33,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:33,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:45:33,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:33,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 313990223, now seen corresponding path program 1 times [2024-11-10 18:45:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200819061] [2024-11-10 18:45:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543713716] [2024-11-10 18:45:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:33,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:33,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:33,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:33,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:45:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:33,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:45:33,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:33,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:33,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200819061] [2024-11-10 18:45:33,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543713716] [2024-11-10 18:45:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543713716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624327678] [2024-11-10 18:45:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:33,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:33,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,762 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-10 18:45:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:33,801 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-10 18:45:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-10 18:45:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:33,803 INFO L225 Difference]: With dead ends: 101 [2024-11-10 18:45:33,803 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 18:45:33,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:33,804 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:33,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 61 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 18:45:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-10 18:45:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.434782608695652) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-11-10 18:45:33,816 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 10 [2024-11-10 18:45:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-10 18:45:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-10 18:45:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-11-10 18:45:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:45:33,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:33,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:33,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 18:45:34,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:34,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1096893613, now seen corresponding path program 1 times [2024-11-10 18:45:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829471451] [2024-11-10 18:45:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195485013] [2024-11-10 18:45:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:34,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:34,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:34,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 18:45:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:34,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:34,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:34,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:34,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829471451] [2024-11-10 18:45:34,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195485013] [2024-11-10 18:45:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195485013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795991530] [2024-11-10 18:45:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:34,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:34,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:34,144 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:34,184 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-10 18:45:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:34,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-10 18:45:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:34,186 INFO L225 Difference]: With dead ends: 95 [2024-11-10 18:45:34,186 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 18:45:34,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:34,187 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:34,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 53 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 18:45:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2024-11-10 18:45:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-10 18:45:34,195 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 12 [2024-11-10 18:45:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:34,195 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-10 18:45:34,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-10 18:45:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 18:45:34,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:34,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:34,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:45:34,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:34,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:34,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -356036368, now seen corresponding path program 1 times [2024-11-10 18:45:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278181434] [2024-11-10 18:45:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:34,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140024077] [2024-11-10 18:45:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:34,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:34,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:34,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:45:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:34,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:34,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:34,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278181434] [2024-11-10 18:45:34,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140024077] [2024-11-10 18:45:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140024077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637130045] [2024-11-10 18:45:34,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:34,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:34,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:34,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:34,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:34,492 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:34,536 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-10 18:45:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-10 18:45:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:34,537 INFO L225 Difference]: With dead ends: 95 [2024-11-10 18:45:34,537 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 18:45:34,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:34,539 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:34,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 18:45:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2024-11-10 18:45:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-10 18:45:34,549 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2024-11-10 18:45:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-10 18:45:34,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-10 18:45:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 18:45:34,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:34,550 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:34,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:34,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 802086471, now seen corresponding path program 1 times [2024-11-10 18:45:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957690647] [2024-11-10 18:45:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595712129] [2024-11-10 18:45:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:34,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:34,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:34,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:45:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:34,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:34,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:34,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:34,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957690647] [2024-11-10 18:45:34,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:34,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595712129] [2024-11-10 18:45:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595712129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:34,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:34,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:45:34,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611881458] [2024-11-10 18:45:34,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:34,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:45:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:45:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:45:34,850 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:34,958 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2024-11-10 18:45:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:45:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-11-10 18:45:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:34,960 INFO L225 Difference]: With dead ends: 141 [2024-11-10 18:45:34,960 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 18:45:34,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:45:34,961 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:34,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 18:45:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2024-11-10 18:45:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 126 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2024-11-10 18:45:34,976 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 16 [2024-11-10 18:45:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:34,979 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2024-11-10 18:45:34,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2024-11-10 18:45:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:45:34,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:34,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:34,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:45:35,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:35,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:35,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash -905123154, now seen corresponding path program 1 times [2024-11-10 18:45:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:35,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752757240] [2024-11-10 18:45:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:35,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306113037] [2024-11-10 18:45:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:35,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:35,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:35,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:45:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:35,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:35,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:35,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752757240] [2024-11-10 18:45:35,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306113037] [2024-11-10 18:45:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306113037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:35,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:45:35,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-10 18:45:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142965705] [2024-11-10 18:45:35,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:35,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:45:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:35,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:45:35,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:45:35,874 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:36,140 INFO L93 Difference]: Finished difference Result 325 states and 409 transitions. [2024-11-10 18:45:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:45:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 17 [2024-11-10 18:45:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:36,141 INFO L225 Difference]: With dead ends: 325 [2024-11-10 18:45:36,141 INFO L226 Difference]: Without dead ends: 322 [2024-11-10 18:45:36,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:45:36,142 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 127 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:36,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 94 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:45:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-10 18:45:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 227. [2024-11-10 18:45:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 226 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 289 transitions. [2024-11-10 18:45:36,166 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 289 transitions. Word has length 17 [2024-11-10 18:45:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:36,166 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 289 transitions. [2024-11-10 18:45:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 289 transitions. [2024-11-10 18:45:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 18:45:36,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:36,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:36,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:45:36,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:36,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:36,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2055010731, now seen corresponding path program 1 times [2024-11-10 18:45:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:36,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309806840] [2024-11-10 18:45:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309806840] [2024-11-10 18:45:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309806840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006594984] [2024-11-10 18:45:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:36,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:36,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:36,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 18:45:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:36,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:45:36,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:36,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:36,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006594984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:36,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:45:36,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-10 18:45:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366299091] [2024-11-10 18:45:36,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:36,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:45:36,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:45:36,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:36,486 INFO L87 Difference]: Start difference. First operand 227 states and 289 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:36,530 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2024-11-10 18:45:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:45:36,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-10 18:45:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:36,532 INFO L225 Difference]: With dead ends: 235 [2024-11-10 18:45:36,532 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 18:45:36,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:36,533 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:36,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 109 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 18:45:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2024-11-10 18:45:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 225 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2024-11-10 18:45:36,547 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 19 [2024-11-10 18:45:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2024-11-10 18:45:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2024-11-10 18:45:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 18:45:36,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:36,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:36,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:36,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:36,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash -719176764, now seen corresponding path program 1 times [2024-11-10 18:45:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505425359] [2024-11-10 18:45:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:36,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505425359] [2024-11-10 18:45:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505425359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109543357] [2024-11-10 18:45:36,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:36,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:36,801 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:36,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 18:45:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:36,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:45:36,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:36,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109543357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:36,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 18:45:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955295341] [2024-11-10 18:45:36,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:45:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:45:36,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:45:36,880 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:37,003 INFO L93 Difference]: Finished difference Result 334 states and 404 transitions. [2024-11-10 18:45:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:45:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 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 20 [2024-11-10 18:45:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:37,005 INFO L225 Difference]: With dead ends: 334 [2024-11-10 18:45:37,005 INFO L226 Difference]: Without dead ends: 332 [2024-11-10 18:45:37,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:45:37,005 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 131 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:37,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-10 18:45:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 296. [2024-11-10 18:45:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 295 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 370 transitions. [2024-11-10 18:45:37,015 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 370 transitions. Word has length 20 [2024-11-10 18:45:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 370 transitions. [2024-11-10 18:45:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 370 transitions. [2024-11-10 18:45:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 18:45:37,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:37,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:37,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 18:45:37,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-10 18:45:37,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:37,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash 658147781, now seen corresponding path program 1 times [2024-11-10 18:45:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:37,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754230647] [2024-11-10 18:45:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754230647] [2024-11-10 18:45:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754230647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:37,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:45:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374623487] [2024-11-10 18:45:37,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:37,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:37,266 INFO L87 Difference]: Start difference. First operand 296 states and 370 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:37,291 INFO L93 Difference]: Finished difference Result 296 states and 370 transitions. [2024-11-10 18:45:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-11-10 18:45:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:37,292 INFO L225 Difference]: With dead ends: 296 [2024-11-10 18:45:37,292 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 18:45:37,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:45:37,293 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:37,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 18:45:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-10 18:45:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 281 states have (on average 1.295373665480427) internal successors, (364), 294 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 364 transitions. [2024-11-10 18:45:37,319 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 364 transitions. Word has length 22 [2024-11-10 18:45:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:37,319 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 364 transitions. [2024-11-10 18:45:37,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 364 transitions. [2024-11-10 18:45:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:45:37,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:37,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:45:37,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1072255290, now seen corresponding path program 1 times [2024-11-10 18:45:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995998069] [2024-11-10 18:45:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:37,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995998069] [2024-11-10 18:45:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995998069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:37,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:37,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:45:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153444719] [2024-11-10 18:45:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:37,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:45:37,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:37,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:45:37,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:45:37,401 INFO L87 Difference]: Start difference. First operand 295 states and 364 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:37,456 INFO L93 Difference]: Finished difference Result 344 states and 428 transitions. [2024-11-10 18:45:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:45:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-10 18:45:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:37,458 INFO L225 Difference]: With dead ends: 344 [2024-11-10 18:45:37,458 INFO L226 Difference]: Without dead ends: 343 [2024-11-10 18:45:37,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:45:37,459 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:37,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-10 18:45:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 311. [2024-11-10 18:45:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 297 states have (on average 1.2828282828282829) internal successors, (381), 310 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 381 transitions. [2024-11-10 18:45:37,470 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 381 transitions. Word has length 23 [2024-11-10 18:45:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:37,470 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 381 transitions. [2024-11-10 18:45:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 381 transitions. [2024-11-10 18:45:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:45:37,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:37,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:37,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:45:37,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:37,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 354816644, now seen corresponding path program 1 times [2024-11-10 18:45:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200238522] [2024-11-10 18:45:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200238522] [2024-11-10 18:45:37,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200238522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:37,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:45:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104773223] [2024-11-10 18:45:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:37,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:45:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:45:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:37,549 INFO L87 Difference]: Start difference. First operand 311 states and 381 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:37,683 INFO L93 Difference]: Finished difference Result 331 states and 402 transitions. [2024-11-10 18:45:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:45:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-11-10 18:45:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:37,685 INFO L225 Difference]: With dead ends: 331 [2024-11-10 18:45:37,685 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 18:45:37,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:45:37,686 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 70 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:37,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 94 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 18:45:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 313. [2024-11-10 18:45:37,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 299 states have (on average 1.2775919732441472) internal successors, (382), 312 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 382 transitions. [2024-11-10 18:45:37,695 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 382 transitions. Word has length 25 [2024-11-10 18:45:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:37,696 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 382 transitions. [2024-11-10 18:45:37,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 382 transitions. [2024-11-10 18:45:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 18:45:37,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:37,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:37,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:45:37,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1885585950, now seen corresponding path program 1 times [2024-11-10 18:45:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809146918] [2024-11-10 18:45:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809146918] [2024-11-10 18:45:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809146918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:45:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117634515] [2024-11-10 18:45:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:45:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:45:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:37,792 INFO L87 Difference]: Start difference. First operand 313 states and 382 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:37,936 INFO L93 Difference]: Finished difference Result 352 states and 426 transitions. [2024-11-10 18:45:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:45:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-10 18:45:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:37,938 INFO L225 Difference]: With dead ends: 352 [2024-11-10 18:45:37,938 INFO L226 Difference]: Without dead ends: 351 [2024-11-10 18:45:37,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:45:37,939 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:37,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 98 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-10 18:45:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 332. [2024-11-10 18:45:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 318 states have (on average 1.2767295597484276) internal successors, (406), 331 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 406 transitions. [2024-11-10 18:45:37,949 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 406 transitions. Word has length 26 [2024-11-10 18:45:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:37,949 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 406 transitions. [2024-11-10 18:45:37,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 406 transitions. [2024-11-10 18:45:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 18:45:37,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:37,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:45:37,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:37,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash -125476607, now seen corresponding path program 1 times [2024-11-10 18:45:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74138669] [2024-11-10 18:45:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:38,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74138669] [2024-11-10 18:45:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74138669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954785475] [2024-11-10 18:45:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:38,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:38,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:38,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:38,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 18:45:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:45:38,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:45:38,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954785475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:45:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-10 18:45:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327790240] [2024-11-10 18:45:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:38,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:45:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:45:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:38,094 INFO L87 Difference]: Start difference. First operand 332 states and 406 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:38,145 INFO L93 Difference]: Finished difference Result 375 states and 453 transitions. [2024-11-10 18:45:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:45:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2024-11-10 18:45:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:38,146 INFO L225 Difference]: With dead ends: 375 [2024-11-10 18:45:38,146 INFO L226 Difference]: Without dead ends: 295 [2024-11-10 18:45:38,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:38,147 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:38,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-10 18:45:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-11-10 18:45:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 281 states have (on average 1.2882562277580072) internal successors, (362), 294 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 362 transitions. [2024-11-10 18:45:38,159 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 362 transitions. Word has length 29 [2024-11-10 18:45:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 362 transitions. [2024-11-10 18:45:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 362 transitions. [2024-11-10 18:45:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 18:45:38,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:38,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:38,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:38,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 18:45:38,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1737588566, now seen corresponding path program 1 times [2024-11-10 18:45:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939880375] [2024-11-10 18:45:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939880375] [2024-11-10 18:45:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939880375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068078048] [2024-11-10 18:45:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:38,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 18:45:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:45:38,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:38,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:45:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068078048] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:38,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:45:38,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 11 [2024-11-10 18:45:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302336274] [2024-11-10 18:45:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:38,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:45:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:38,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:45:38,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:45:38,601 INFO L87 Difference]: Start difference. First operand 295 states and 362 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:38,683 INFO L93 Difference]: Finished difference Result 295 states and 362 transitions. [2024-11-10 18:45:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:45:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 34 [2024-11-10 18:45:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:38,684 INFO L225 Difference]: With dead ends: 295 [2024-11-10 18:45:38,684 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 18:45:38,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:45:38,686 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:38,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 18:45:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 18:45:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-11-10 18:45:38,690 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 34 [2024-11-10 18:45:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:38,690 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-11-10 18:45:38,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-11-10 18:45:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 18:45:38,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:38,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2024-11-10 18:45:38,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:38,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 18:45:38,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1111753816, now seen corresponding path program 1 times [2024-11-10 18:45:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795667292] [2024-11-10 18:45:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795667292] [2024-11-10 18:45:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795667292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989918040] [2024-11-10 18:45:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:38,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:38,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:38,931 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:38,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 18:45:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:38,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:45:38,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:38,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989918040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:39,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 18:45:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650641032] [2024-11-10 18:45:39,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:45:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:45:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:45:39,030 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:39,089 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-10 18:45:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:45:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 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 34 [2024-11-10 18:45:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:39,090 INFO L225 Difference]: With dead ends: 84 [2024-11-10 18:45:39,090 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 18:45:39,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:45:39,091 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:39,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 18:45:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-10 18:45:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 80 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-10 18:45:39,094 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 34 [2024-11-10 18:45:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:39,094 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-10 18:45:39,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-10 18:45:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 18:45:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:39,098 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-10 18:45:39,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 18:45:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 18:45:39,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:39,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -910417602, now seen corresponding path program 2 times [2024-11-10 18:45:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890239731] [2024-11-10 18:45:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338003670] [2024-11-10 18:45:39,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:45:39,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:39,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:39,307 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:39,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 18:45:39,342 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:45:39,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:39,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:45:39,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:39,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890239731] [2024-11-10 18:45:41,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338003670] [2024-11-10 18:45:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338003670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:45:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:45:41,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732641764] [2024-11-10 18:45:41,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:45:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:45:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:45:41,111 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:41,332 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2024-11-10 18:45:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:45:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 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 50 [2024-11-10 18:45:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:41,333 INFO L225 Difference]: With dead ends: 126 [2024-11-10 18:45:41,333 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 18:45:41,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:45:41,334 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:41,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 66 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:45:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 18:45:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-10 18:45:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 118 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2024-11-10 18:45:41,338 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 50 [2024-11-10 18:45:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2024-11-10 18:45:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2024-11-10 18:45:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 18:45:41,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:41,338 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-10 18:45:41,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 18:45:41,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 18:45:41,539 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:41,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 467712820, now seen corresponding path program 2 times [2024-11-10 18:45:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290777523] [2024-11-10 18:45:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290777523] [2024-11-10 18:45:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290777523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855715559] [2024-11-10 18:45:41,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:45:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:41,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:41,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 18:45:41,625 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:45:41,625 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:41,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:45:41,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:41,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855715559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:41,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 18:45:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055103325] [2024-11-10 18:45:41,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:45:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:45:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:45:41,783 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:41,884 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-10 18:45:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:45:41,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 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 53 [2024-11-10 18:45:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:41,885 INFO L225 Difference]: With dead ends: 126 [2024-11-10 18:45:41,885 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 18:45:41,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:45:41,886 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:41,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 97 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 18:45:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-10 18:45:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 119 states have (on average 1.050420168067227) internal successors, (125), 121 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2024-11-10 18:45:41,890 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 53 [2024-11-10 18:45:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2024-11-10 18:45:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2024-11-10 18:45:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 18:45:41,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:41,890 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1] [2024-11-10 18:45:41,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:42,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 18:45:42,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:42,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2133260376, now seen corresponding path program 2 times [2024-11-10 18:45:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810666088] [2024-11-10 18:45:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810666088] [2024-11-10 18:45:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810666088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049454805] [2024-11-10 18:45:42,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:45:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:42,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:42,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 18:45:42,187 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:45:42,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:42,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:42,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-10 18:45:42,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-10 18:45:42,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049454805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:42,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 13 [2024-11-10 18:45:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347729057] [2024-11-10 18:45:42,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:42,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 18:45:42,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 18:45:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:45:42,588 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 14 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:42,776 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2024-11-10 18:45:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 18:45:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 14 states have internal predecessors, (111), 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 78 [2024-11-10 18:45:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:42,777 INFO L225 Difference]: With dead ends: 122 [2024-11-10 18:45:42,777 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 18:45:42,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2024-11-10 18:45:42,778 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:42,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:45:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 18:45:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 18:45:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 120 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2024-11-10 18:45:42,782 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 78 [2024-11-10 18:45:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2024-11-10 18:45:42,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 14 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2024-11-10 18:45:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 18:45:42,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:42,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-10 18:45:42,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 18:45:42,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:42,986 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 369708862, now seen corresponding path program 3 times [2024-11-10 18:45:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533156911] [2024-11-10 18:45:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:42,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118143072] [2024-11-10 18:45:42,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:45:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:42,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:42,997 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:42,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 18:45:43,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 18:45:43,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:43,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:45:43,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-10 18:45:43,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:45:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533156911] [2024-11-10 18:45:43,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 18:45:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118143072] [2024-11-10 18:45:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118143072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:45:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:45:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:45:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949661961] [2024-11-10 18:45:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:45:43,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:45:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:45:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:43,131 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:43,141 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2024-11-10 18:45:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:45:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 116 [2024-11-10 18:45:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:43,142 INFO L225 Difference]: With dead ends: 121 [2024-11-10 18:45:43,142 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 18:45:43,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:45:43,142 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:43,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:45:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 18:45:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 18:45:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.0084033613445378) internal successors, (120), 119 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2024-11-10 18:45:43,146 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2024-11-10 18:45:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2024-11-10 18:45:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2024-11-10 18:45:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 18:45:43,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:43,147 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1] [2024-11-10 18:45:43,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 18:45:43,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:43,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:43,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1700580660, now seen corresponding path program 3 times [2024-11-10 18:45:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:43,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014516453] [2024-11-10 18:45:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014516453] [2024-11-10 18:45:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014516453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331465160] [2024-11-10 18:45:43,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:45:43,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:43,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:43,511 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:43,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 18:45:43,550 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 18:45:43,551 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:43,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:45:43,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:43,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331465160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-11-10 18:45:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884961486] [2024-11-10 18:45:43,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 18:45:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 18:45:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:45:43,865 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand has 25 states, 24 states have (on average 10.25) internal successors, (246), 25 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:44,038 INFO L93 Difference]: Finished difference Result 253 states and 264 transitions. [2024-11-10 18:45:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 18:45:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 10.25) internal successors, (246), 25 states have internal predecessors, (246), 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 119 [2024-11-10 18:45:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:44,039 INFO L225 Difference]: With dead ends: 253 [2024-11-10 18:45:44,039 INFO L226 Difference]: Without dead ends: 252 [2024-11-10 18:45:44,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:45:44,040 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:44,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:45:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-10 18:45:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-10 18:45:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.00398406374502) internal successors, (252), 251 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2024-11-10 18:45:44,046 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 119 [2024-11-10 18:45:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:44,047 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2024-11-10 18:45:44,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 10.25) internal successors, (246), 25 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2024-11-10 18:45:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-10 18:45:44,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:44,049 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1] [2024-11-10 18:45:44,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-10 18:45:44,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:44,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:44,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1620013364, now seen corresponding path program 4 times [2024-11-10 18:45:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:44,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070416577] [2024-11-10 18:45:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:45:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 0 proven. 2695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:45:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070416577] [2024-11-10 18:45:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070416577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:45:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746358205] [2024-11-10 18:45:44,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:45:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:44,898 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:44,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 18:45:44,947 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:45:44,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:45:44,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 18:45:44,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:45:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 0 proven. 2695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:45,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:45:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 0 proven. 2695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:45:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746358205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:45:45,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:45:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-11-10 18:45:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178284298] [2024-11-10 18:45:45,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:45:45,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 18:45:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:45:45,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 18:45:45,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 18:45:45,648 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 49 states, 48 states have (on average 10.625) internal successors, (510), 49 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:45:45,848 INFO L93 Difference]: Finished difference Result 341 states and 348 transitions. [2024-11-10 18:45:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 18:45:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 10.625) internal successors, (510), 49 states have internal predecessors, (510), 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 251 [2024-11-10 18:45:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:45:45,850 INFO L225 Difference]: With dead ends: 341 [2024-11-10 18:45:45,850 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 18:45:45,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 18:45:45,851 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:45:45,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:45:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 18:45:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-11-10 18:45:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.0029498525073746) internal successors, (340), 339 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2024-11-10 18:45:45,859 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 251 [2024-11-10 18:45:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:45:45,859 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2024-11-10 18:45:45,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 10.625) internal successors, (510), 49 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:45:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2024-11-10 18:45:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 18:45:45,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:45:45,862 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1] [2024-11-10 18:45:45,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:46,063 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-10 18:45:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:45:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1218672332, now seen corresponding path program 5 times [2024-11-10 18:45:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:45:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740617197] [2024-11-10 18:45:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:45:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:45:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 18:45:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784753695] [2024-11-10 18:45:46,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 18:45:46,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:45:46,091 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:45:46,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 18:45:46,164 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2024-11-10 18:45:46,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 18:45:46,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:45:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:45:46,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:45:46,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:45:46,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-11-10 18:45:46,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-11-10 18:45:46,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-11-10 18:45:46,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-10 18:45:46,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:45:46,441 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:45:46,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:45:46,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:45:46 BoogieIcfgContainer [2024-11-10 18:45:46,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:45:46,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:45:46,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:45:46,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:45:46,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:32" (3/4) ... [2024-11-10 18:45:46,512 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:45:46,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:45:46,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:45:46,586 INFO L158 Benchmark]: Toolchain (without parser) took 14203.03ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 119.2MB in the beginning and 137.2MB in the end (delta: -18.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,586 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 197.1MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:45:46,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.58ms. Allocated memory is still 197.1MB. Free memory was 118.9MB in the beginning and 107.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.63ms. Allocated memory is still 197.1MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,586 INFO L158 Benchmark]: Boogie Preprocessor took 16.91ms. Allocated memory is still 197.1MB. Free memory was 105.8MB in the beginning and 104.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,587 INFO L158 Benchmark]: IcfgBuilder took 301.31ms. Allocated memory is still 197.1MB. Free memory was 104.5MB in the beginning and 157.9MB in the end (delta: -53.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,587 INFO L158 Benchmark]: TraceAbstraction took 13590.48ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 157.9MB in the beginning and 147.7MB in the end (delta: 10.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,587 INFO L158 Benchmark]: Witness Printer took 74.34ms. Allocated memory is still 241.2MB. Free memory was 147.7MB in the beginning and 137.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 18:45:46,588 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.17ms. Allocated memory is still 197.1MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.58ms. Allocated memory is still 197.1MB. Free memory was 118.9MB in the beginning and 107.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.63ms. Allocated memory is still 197.1MB. Free memory was 107.3MB in the beginning and 105.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.91ms. Allocated memory is still 197.1MB. Free memory was 105.8MB in the beginning and 104.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 301.31ms. Allocated memory is still 197.1MB. Free memory was 104.5MB in the beginning and 157.9MB in the end (delta: -53.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13590.48ms. Allocated memory was 197.1MB in the beginning and 241.2MB in the end (delta: 44.0MB). Free memory was 157.9MB in the beginning and 147.7MB in the end (delta: 10.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Witness Printer took 74.34ms. Allocated memory is still 241.2MB. Free memory was 147.7MB in the beginning and 137.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 39]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int A, B; [L24] int r, d, p, q; [L25] A = __VERIFIER_nondet_int() [L26] B = 1 [L28] r = A [L29] d = B [L30] p = 1 [L31] q = 0 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=1, p=1, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=2, p=1, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=2, p=2, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=4, p=2, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=4, p=4, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=8, p=4, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=8, p=8, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=16, p=8, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=16, p=16, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=32, p=16, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=32, p=32, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=64, p=32, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=64, p=64, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=128, p=64, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=128, p=128, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=256, p=128, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=256, p=256, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=512, p=256, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=512, p=512, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=1024, p=512, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=1024, p=1024, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=2048, p=1024, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=2048, p=2048, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=4096, p=2048, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=4096, p=4096, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=8192, p=4096, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=8192, p=8192, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=16384, p=8192, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=16384, p=16384, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=32768, p=16384, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=32768, p=32768, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=65536, p=32768, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=65536, p=65536, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=131072, p=65536, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=131072, p=131072, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=262144, p=131072, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=262144, p=262144, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=524288, p=262144, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=524288, p=524288, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=1048576, p=524288, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=1048576, p=1048576, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=2097152, p=1048576, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=2097152, p=2097152, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=4194304, p=2097152, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=4194304, p=4194304, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=8388608, p=4194304, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=8388608, p=8388608, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=16777216, p=8388608, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=16777216, p=16777216, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=33554432, p=16777216, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=33554432, p=33554432, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=67108864, p=33554432, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=67108864, p=67108864, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=134217728, p=67108864, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=134217728, p=134217728, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=268435456, p=134217728, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=268435456, p=268435456, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=536870912, p=268435456, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] EXPR 2 * d VAL [A=0, B=1, d=536870912, p=536870912, q=0, r=0] [L39] d = 2 * d VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] EXPR 2 * p VAL [A=0, B=1, d=1073741824, p=536870912, q=0, r=0] [L40] p = 2 * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L33] COND TRUE 1 VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] EXPR B * p VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L37] COND FALSE !(!(d == B * p)) VAL [A=0, B=1, d=1073741824, p=1073741824, q=0, r=0] [L39] 2 * d VAL [A=0, B=1, p=1073741824, q=0, r=0] - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 752 mSDsluCounter, 1881 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1252 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 629 mSDtfsCounter, 1433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1610 GetRequests, 1439 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=22, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 264 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2534 NumberOfCodeBlocks, 2369 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 2233 ConstructedInterpolants, 126 QuantifiedInterpolants, 8660 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1092 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 40 InterpolantComputations, 14 PerfectInterpolantSequences, 947/11604 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 18:45:46,607 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)