./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound10.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 58e0ac80b52681cc0cdead13de3f6425618df79dffe8d2a1da55e71c89383d0a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:58:57,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:58:57,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:58:57,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:58:57,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:58:57,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:58:57,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:58:57,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:58:57,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:58:57,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:58:57,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:58:57,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:58:57,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:58:57,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:58:57,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:58:57,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:58:57,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:58:57,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:58:57,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:58:57,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:58:57,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:58:57,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:58:57,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:58:57,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:58:57,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:58:57,615 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:58:57,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:58:57,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:58:57,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:58:57,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:58:57,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:58:57,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:58:57,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:58:57,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:58:57,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:58:57,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:58:57,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:58:57,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:58:57,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:58:57,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:58:57,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:58:57,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:58:57,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:58:57,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:58:57,626 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 -> 58e0ac80b52681cc0cdead13de3f6425618df79dffe8d2a1da55e71c89383d0a [2024-11-09 11:58:57,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:58:57,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:58:57,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:58:57,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:58:57,904 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:58:57,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound10.c [2024-11-09 11:58:59,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:58:59,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:58:59,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound10.c [2024-11-09 11:58:59,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae6f317f/a3e17ace5e2640dd83549e312ec48311/FLAG70566a16c [2024-11-09 11:58:59,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae6f317f/a3e17ace5e2640dd83549e312ec48311 [2024-11-09 11:58:59,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:58:59,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:58:59,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:58:59,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:58:59,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:58:59,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:59" (1/1) ... [2024-11-09 11:58:59,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33309a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:59, skipping insertion in model container [2024-11-09 11:58:59,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:59" (1/1) ... [2024-11-09 11:58:59,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:59:00,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:59:00,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:59:00,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:59:00,137 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:59:00,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00 WrapperNode [2024-11-09 11:59:00,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:59:00,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:59:00,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:59:00,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:59:00,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,174 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-11-09 11:59:00,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:59:00,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:59:00,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:59:00,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:59:00,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:59:00,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:59:00,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:59:00,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:59:00,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:59:00,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (1/1) ... [2024-11-09 11:59:00,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:59:00,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:00,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:59:00,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:59:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:59:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:59:00,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:59:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:59:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:59:00,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:59:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:59:00,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:59:00,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:59:00,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:59:00,672 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-09 11:59:00,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:59:00,690 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:59:00,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:59:00,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:59:00 BoogieIcfgContainer [2024-11-09 11:59:00,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:59:00,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:59:00,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:59:00,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:59:00,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:58:59" (1/3) ... [2024-11-09 11:59:00,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dc4256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:00, skipping insertion in model container [2024-11-09 11:59:00,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:59:00" (2/3) ... [2024-11-09 11:59:00,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dc4256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:59:00, skipping insertion in model container [2024-11-09 11:59:00,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:59:00" (3/3) ... [2024-11-09 11:59:00,710 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.c [2024-11-09 11:59:00,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:59:00,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-09 11:59:00,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:59:00,816 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;@4db4f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:59:00,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 11:59:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:59:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:59:00,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:00,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:00,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2141166240, now seen corresponding path program 1 times [2024-11-09 11:59:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355376563] [2024-11-09 11:59:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:00,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:01,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355376563] [2024-11-09 11:59:01,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355376563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:59:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53176487] [2024-11-09 11:59:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:01,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:59:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:59:01,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:59:01,041 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:59:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:01,064 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2024-11-09 11:59:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:59:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 11:59:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:01,074 INFO L225 Difference]: With dead ends: 134 [2024-11-09 11:59:01,075 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 11:59:01,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:59:01,082 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:01,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 11:59:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 11:59:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:59:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-09 11:59:01,124 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 15 [2024-11-09 11:59:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:01,125 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-09 11:59:01,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:59:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-09 11:59:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:59:01,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:01,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:01,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:59:01,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:01,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1382845121, now seen corresponding path program 1 times [2024-11-09 11:59:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097582649] [2024-11-09 11:59:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:01,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097582649] [2024-11-09 11:59:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097582649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:01,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906417332] [2024-11-09 11:59:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:01,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:01,356 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:01,472 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2024-11-09 11:59:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-09 11:59:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:01,474 INFO L225 Difference]: With dead ends: 62 [2024-11-09 11:59:01,474 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 11:59:01,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:59:01,475 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:01,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 11:59:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 11:59:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 55 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:59:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-11-09 11:59:01,490 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 15 [2024-11-09 11:59:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:01,491 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-11-09 11:59:01,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-11-09 11:59:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:59:01,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:01,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:01,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:59:01,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:01,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 81474253, now seen corresponding path program 1 times [2024-11-09 11:59:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:01,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868302940] [2024-11-09 11:59:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868302940] [2024-11-09 11:59:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868302940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503887786] [2024-11-09 11:59:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:01,616 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:01,656 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-11-09 11:59:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:59:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-11-09 11:59:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:01,659 INFO L225 Difference]: With dead ends: 74 [2024-11-09 11:59:01,659 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 11:59:01,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:59:01,661 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:01,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 11:59:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 11:59:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 59 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:59:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-09 11:59:01,675 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 16 [2024-11-09 11:59:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-09 11:59:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-09 11:59:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 11:59:01,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:01,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:59:01,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash 987347375, now seen corresponding path program 1 times [2024-11-09 11:59:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58397378] [2024-11-09 11:59:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507350547] [2024-11-09 11:59:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:01,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:01,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:59:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:01,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:59:01,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:01,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58397378] [2024-11-09 11:59:01,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:01,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507350547] [2024-11-09 11:59:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507350547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:59:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203581808] [2024-11-09 11:59:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:01,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:59:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:59:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:59:01,820 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:01,940 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-09 11:59:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:59:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-09 11:59:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:01,942 INFO L225 Difference]: With dead ends: 103 [2024-11-09 11:59:01,942 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 11:59:01,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-09 11:59:01,944 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:01,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 86 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 11:59:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-11-09 11:59:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 81 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:59:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2024-11-09 11:59:01,956 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 18 [2024-11-09 11:59:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:01,956 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2024-11-09 11:59:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2024-11-09 11:59:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 11:59:01,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:01,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:01,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:02,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:02,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash -346943343, now seen corresponding path program 1 times [2024-11-09 11:59:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:02,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831219319] [2024-11-09 11:59:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:02,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831219319] [2024-11-09 11:59:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831219319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456556271] [2024-11-09 11:59:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:02,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:02,257 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:02,479 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-09 11:59:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 11:59:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:02,482 INFO L225 Difference]: With dead ends: 137 [2024-11-09 11:59:02,482 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 11:59:02,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 11:59:02,483 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:02,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 11:59:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2024-11-09 11:59:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.5578947368421052) internal successors, (148), 115 states have internal predecessors, (148), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:59:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 160 transitions. [2024-11-09 11:59:02,499 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 160 transitions. Word has length 20 [2024-11-09 11:59:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:02,499 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 160 transitions. [2024-11-09 11:59:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2024-11-09 11:59:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 11:59:02,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:02,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:02,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:59:02,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2129658312, now seen corresponding path program 1 times [2024-11-09 11:59:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872710443] [2024-11-09 11:59:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872710443] [2024-11-09 11:59:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872710443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141111358] [2024-11-09 11:59:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:02,619 INFO L87 Difference]: Start difference. First operand 124 states and 160 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:02,765 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2024-11-09 11:59:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 11:59:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:02,768 INFO L225 Difference]: With dead ends: 134 [2024-11-09 11:59:02,769 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 11:59:02,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 11:59:02,770 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 41 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:02,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 95 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 11:59:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2024-11-09 11:59:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 111 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:59:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-11-09 11:59:02,788 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 21 [2024-11-09 11:59:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:02,789 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-11-09 11:59:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-11-09 11:59:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 11:59:02,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:02,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:02,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:59:02,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1594898291, now seen corresponding path program 1 times [2024-11-09 11:59:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41961466] [2024-11-09 11:59:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41961466] [2024-11-09 11:59:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41961466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996594809] [2024-11-09 11:59:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:02,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:02,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:59:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:03,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:59:03,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:03,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996594809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:03,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 11:59:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093910512] [2024-11-09 11:59:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:03,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:03,167 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:03,268 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2024-11-09 11:59:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 11:59:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:03,269 INFO L225 Difference]: With dead ends: 123 [2024-11-09 11:59:03,269 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 11:59:03,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:59:03,270 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:03,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 11:59:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-09 11:59:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:59:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 150 transitions. [2024-11-09 11:59:03,288 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 150 transitions. Word has length 22 [2024-11-09 11:59:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:03,288 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 150 transitions. [2024-11-09 11:59:03,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 150 transitions. [2024-11-09 11:59:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:59:03,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:03,289 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:03,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:59:03,489 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,SelfDestructingSolverStorable6 [2024-11-09 11:59:03,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2097760470, now seen corresponding path program 1 times [2024-11-09 11:59:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872954419] [2024-11-09 11:59:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288211200] [2024-11-09 11:59:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:03,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:03,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:03,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:59:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:03,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:59:03,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:03,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872954419] [2024-11-09 11:59:03,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288211200] [2024-11-09 11:59:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288211200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463792345] [2024-11-09 11:59:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:03,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:03,654 INFO L87 Difference]: Start difference. First operand 120 states and 150 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:03,782 INFO L93 Difference]: Finished difference Result 121 states and 150 transitions. [2024-11-09 11:59:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:03,783 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 11:59:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:03,784 INFO L225 Difference]: With dead ends: 121 [2024-11-09 11:59:03,784 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 11:59:03,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-09 11:59:03,785 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:03,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 79 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 11:59:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 11:59:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 111 states have internal predecessors, (137), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:59:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2024-11-09 11:59:03,793 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 23 [2024-11-09 11:59:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:03,794 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2024-11-09 11:59:03,794 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:59:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2024-11-09 11:59:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 11:59:03,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:03,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:03,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:03,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:03,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:03,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 909892350, now seen corresponding path program 1 times [2024-11-09 11:59:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950929559] [2024-11-09 11:59:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950929559] [2024-11-09 11:59:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950929559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279272148] [2024-11-09 11:59:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:04,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:04,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:04,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:04,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:59:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:59:04,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:04,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279272148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:04,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:04,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-09 11:59:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717571349] [2024-11-09 11:59:04,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:59:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:59:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:04,391 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:04,500 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2024-11-09 11:59:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:59:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2024-11-09 11:59:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:04,502 INFO L225 Difference]: With dead ends: 190 [2024-11-09 11:59:04,502 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 11:59:04,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:04,503 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 265 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:04,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 11:59:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2024-11-09 11:59:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.5073529411764706) internal successors, (205), 156 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:59:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 221 transitions. [2024-11-09 11:59:04,520 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 221 transitions. Word has length 35 [2024-11-09 11:59:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 221 transitions. [2024-11-09 11:59:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 221 transitions. [2024-11-09 11:59:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:59:04,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:04,522 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:04,539 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-09 11:59:04,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:04,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1858108130, now seen corresponding path program 1 times [2024-11-09 11:59:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139855915] [2024-11-09 11:59:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139855915] [2024-11-09 11:59:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139855915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:04,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273650009] [2024-11-09 11:59:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:04,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:04,784 INFO L87 Difference]: Start difference. First operand 167 states and 221 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:04,822 INFO L93 Difference]: Finished difference Result 177 states and 230 transitions. [2024-11-09 11:59:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-09 11:59:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:04,823 INFO L225 Difference]: With dead ends: 177 [2024-11-09 11:59:04,824 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 11:59:04,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-09 11:59:04,824 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:04,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 78 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 11:59:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-11-09 11:59:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.4705882352941178) internal successors, (200), 154 states have internal predecessors, (200), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:59:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2024-11-09 11:59:04,843 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 36 [2024-11-09 11:59:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:04,843 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2024-11-09 11:59:04,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2024-11-09 11:59:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:59:04,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:04,846 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:04,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:59:04,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1360750196, now seen corresponding path program 1 times [2024-11-09 11:59:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14687889] [2024-11-09 11:59:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14687889] [2024-11-09 11:59:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14687889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995249958] [2024-11-09 11:59:04,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:04,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:04,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:59:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:04,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:59:04,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:05,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995249958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:59:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078028775] [2024-11-09 11:59:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:05,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:59:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:05,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:59:05,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:05,017 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:05,065 INFO L93 Difference]: Finished difference Result 175 states and 225 transitions. [2024-11-09 11:59:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:59:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-09 11:59:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:05,067 INFO L225 Difference]: With dead ends: 175 [2024-11-09 11:59:05,067 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 11:59:05,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:05,068 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:05,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:05,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 11:59:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2024-11-09 11:59:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 153 states have internal predecessors, (195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:59:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2024-11-09 11:59:05,076 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 39 [2024-11-09 11:59:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:05,077 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2024-11-09 11:59:05,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2024-11-09 11:59:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:59:05,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:05,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:59:05,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 11:59:05,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:05,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:05,280 INFO L85 PathProgramCache]: Analyzing trace with hash 29303785, now seen corresponding path program 1 times [2024-11-09 11:59:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:05,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168633039] [2024-11-09 11:59:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168633039] [2024-11-09 11:59:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168633039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171895241] [2024-11-09 11:59:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:05,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:05,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:05,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:59:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:05,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:05,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:05,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171895241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:05,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:59:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37406479] [2024-11-09 11:59:05,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:59:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:59:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:59:05,535 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:59:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:05,661 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2024-11-09 11:59:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:59:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 41 [2024-11-09 11:59:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:05,664 INFO L225 Difference]: With dead ends: 306 [2024-11-09 11:59:05,664 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 11:59:05,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:59:05,665 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:05,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 345 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:59:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 11:59:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 252. [2024-11-09 11:59:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 218 states have (on average 1.408256880733945) internal successors, (307), 235 states have internal predecessors, (307), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:59:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 329 transitions. [2024-11-09 11:59:05,681 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 329 transitions. Word has length 41 [2024-11-09 11:59:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:05,681 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 329 transitions. [2024-11-09 11:59:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 11:59:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 329 transitions. [2024-11-09 11:59:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:59:05,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:05,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:05,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:59:05,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:05,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:05,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash 29303800, now seen corresponding path program 1 times [2024-11-09 11:59:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719074577] [2024-11-09 11:59:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:05,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584063597] [2024-11-09 11:59:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:05,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:05,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:05,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:59:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:05,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:59:05,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:06,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719074577] [2024-11-09 11:59:06,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584063597] [2024-11-09 11:59:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584063597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:06,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-09 11:59:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966022818] [2024-11-09 11:59:06,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:06,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:59:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:59:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:06,281 INFO L87 Difference]: Start difference. First operand 252 states and 329 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:06,408 INFO L93 Difference]: Finished difference Result 259 states and 332 transitions. [2024-11-09 11:59:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:59:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-09 11:59:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:06,410 INFO L225 Difference]: With dead ends: 259 [2024-11-09 11:59:06,410 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 11:59:06,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:59:06,412 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 65 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:06,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 82 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 11:59:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2024-11-09 11:59:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 219 states have (on average 1.3059360730593608) internal successors, (286), 231 states have internal predecessors, (286), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:59:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 308 transitions. [2024-11-09 11:59:06,426 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 308 transitions. Word has length 41 [2024-11-09 11:59:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:06,427 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 308 transitions. [2024-11-09 11:59:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 308 transitions. [2024-11-09 11:59:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:59:06,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:06,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:06,445 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-09 11:59:06,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:06,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:06,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 908417853, now seen corresponding path program 1 times [2024-11-09 11:59:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502126237] [2024-11-09 11:59:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247545227] [2024-11-09 11:59:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:06,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:06,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:06,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:06,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:59:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:06,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:59:06,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:06,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:07,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502126237] [2024-11-09 11:59:07,271 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247545227] [2024-11-09 11:59:07,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247545227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:07,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:07,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-11-09 11:59:07,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461989259] [2024-11-09 11:59:07,272 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:07,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:59:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:07,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:59:07,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:07,274 INFO L87 Difference]: Start difference. First operand 248 states and 308 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:07,488 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2024-11-09 11:59:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:59:07,489 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 11:59:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:07,491 INFO L225 Difference]: With dead ends: 336 [2024-11-09 11:59:07,491 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 11:59:07,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:07,492 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 70 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:07,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 154 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 11:59:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2024-11-09 11:59:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 283 states have (on average 1.2862190812720848) internal successors, (364), 295 states have internal predecessors, (364), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 392 transitions. [2024-11-09 11:59:07,508 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 392 transitions. Word has length 42 [2024-11-09 11:59:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:07,508 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 392 transitions. [2024-11-09 11:59:07,509 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 392 transitions. [2024-11-09 11:59:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:59:07,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:07,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:07,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:59:07,710 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,SelfDestructingSolverStorable13 [2024-11-09 11:59:07,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:07,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 280756176, now seen corresponding path program 1 times [2024-11-09 11:59:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432833565] [2024-11-09 11:59:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:07,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:07,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432833565] [2024-11-09 11:59:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432833565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282232257] [2024-11-09 11:59:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:07,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:07,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:59:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:07,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:59:07,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:07,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282232257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-09 11:59:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915586304] [2024-11-09 11:59:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:59:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:59:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:59:07,977 INFO L87 Difference]: Start difference. First operand 315 states and 392 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:08,110 INFO L93 Difference]: Finished difference Result 315 states and 392 transitions. [2024-11-09 11:59:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:59:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-09 11:59:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:08,113 INFO L225 Difference]: With dead ends: 315 [2024-11-09 11:59:08,113 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 11:59:08,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:59:08,114 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:08,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 11:59:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-11-09 11:59:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 280 states have (on average 1.275) internal successors, (357), 290 states have internal predecessors, (357), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 385 transitions. [2024-11-09 11:59:08,131 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 385 transitions. Word has length 43 [2024-11-09 11:59:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 385 transitions. [2024-11-09 11:59:08,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 385 transitions. [2024-11-09 11:59:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 11:59:08,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:08,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:08,148 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-09 11:59:08,335 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,SelfDestructingSolverStorable14 [2024-11-09 11:59:08,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:08,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash 113506921, now seen corresponding path program 1 times [2024-11-09 11:59:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687323377] [2024-11-09 11:59:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687323377] [2024-11-09 11:59:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687323377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875389262] [2024-11-09 11:59:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:08,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:59:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:08,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:08,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:08,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:08,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875389262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:08,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2024-11-09 11:59:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068260420] [2024-11-09 11:59:08,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:59:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:59:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:08,753 INFO L87 Difference]: Start difference. First operand 310 states and 385 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:59:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:08,998 INFO L93 Difference]: Finished difference Result 318 states and 389 transitions. [2024-11-09 11:59:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:59:08,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2024-11-09 11:59:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:09,000 INFO L225 Difference]: With dead ends: 318 [2024-11-09 11:59:09,000 INFO L226 Difference]: Without dead ends: 310 [2024-11-09 11:59:09,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:09,001 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:09,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 189 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-09 11:59:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-09 11:59:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 280 states have (on average 1.2607142857142857) internal successors, (353), 290 states have internal predecessors, (353), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 381 transitions. [2024-11-09 11:59:09,017 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 381 transitions. Word has length 44 [2024-11-09 11:59:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:09,017 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 381 transitions. [2024-11-09 11:59:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:59:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 381 transitions. [2024-11-09 11:59:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 11:59:09,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:09,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:09,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:59:09,218 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,SelfDestructingSolverStorable15 [2024-11-09 11:59:09,219 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:09,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -776252686, now seen corresponding path program 1 times [2024-11-09 11:59:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958119678] [2024-11-09 11:59:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958119678] [2024-11-09 11:59:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958119678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:09,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:09,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:09,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478551981] [2024-11-09 11:59:09,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:09,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:09,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:09,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:09,275 INFO L87 Difference]: Start difference. First operand 310 states and 381 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:09,447 INFO L93 Difference]: Finished difference Result 317 states and 388 transitions. [2024-11-09 11:59:09,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:09,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-09 11:59:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:09,450 INFO L225 Difference]: With dead ends: 317 [2024-11-09 11:59:09,450 INFO L226 Difference]: Without dead ends: 316 [2024-11-09 11:59:09,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-09 11:59:09,450 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:09,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-09 11:59:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 310. [2024-11-09 11:59:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 280 states have (on average 1.2392857142857143) internal successors, (347), 290 states have internal predecessors, (347), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 375 transitions. [2024-11-09 11:59:09,466 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 375 transitions. Word has length 45 [2024-11-09 11:59:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:09,466 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 375 transitions. [2024-11-09 11:59:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 375 transitions. [2024-11-09 11:59:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 11:59:09,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:09,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:09,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:59:09,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash 87381308, now seen corresponding path program 1 times [2024-11-09 11:59:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286833510] [2024-11-09 11:59:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286833510] [2024-11-09 11:59:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286833510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511192552] [2024-11-09 11:59:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:09,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:09,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:09,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:09,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:59:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:09,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:59:09,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:09,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:59:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511192552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:10,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-09 11:59:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009165030] [2024-11-09 11:59:10,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:10,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:59:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:10,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:59:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:59:10,047 INFO L87 Difference]: Start difference. First operand 310 states and 375 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:59:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:10,543 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2024-11-09 11:59:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:59:10,544 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-09 11:59:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:10,545 INFO L225 Difference]: With dead ends: 320 [2024-11-09 11:59:10,545 INFO L226 Difference]: Without dead ends: 317 [2024-11-09 11:59:10,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:59:10,546 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 203 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:10,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 138 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:59:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-09 11:59:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 307. [2024-11-09 11:59:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 280 states have (on average 1.1892857142857143) internal successors, (333), 287 states have internal predecessors, (333), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 361 transitions. [2024-11-09 11:59:10,563 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 361 transitions. Word has length 45 [2024-11-09 11:59:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:10,563 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 361 transitions. [2024-11-09 11:59:10,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:59:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 361 transitions. [2024-11-09 11:59:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:59:10,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:10,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:10,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:10,768 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,SelfDestructingSolverStorable17 [2024-11-09 11:59:10,769 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1705970571, now seen corresponding path program 1 times [2024-11-09 11:59:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479817113] [2024-11-09 11:59:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:10,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:10,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479817113] [2024-11-09 11:59:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479817113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:59:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:59:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727634048] [2024-11-09 11:59:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:59:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:59:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:59:10,840 INFO L87 Difference]: Start difference. First operand 307 states and 361 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:11,052 INFO L93 Difference]: Finished difference Result 314 states and 368 transitions. [2024-11-09 11:59:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:59:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-09 11:59:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:11,054 INFO L225 Difference]: With dead ends: 314 [2024-11-09 11:59:11,054 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 11:59:11,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-09 11:59:11,055 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:11,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 76 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 11:59:11,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2024-11-09 11:59:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 280 states have (on average 1.167857142857143) internal successors, (327), 287 states have internal predecessors, (327), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:59:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 355 transitions. [2024-11-09 11:59:11,072 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 355 transitions. Word has length 46 [2024-11-09 11:59:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:11,072 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 355 transitions. [2024-11-09 11:59:11,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 355 transitions. [2024-11-09 11:59:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:59:11,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:11,073 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:59:11,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1586146687, now seen corresponding path program 1 times [2024-11-09 11:59:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942851607] [2024-11-09 11:59:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762983632] [2024-11-09 11:59:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:11,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:11,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:11,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 11:59:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:11,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 11:59:11,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:11,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942851607] [2024-11-09 11:59:11,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762983632] [2024-11-09 11:59:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762983632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:11,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 11:59:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202791680] [2024-11-09 11:59:11,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:11,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:59:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:59:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:11,465 INFO L87 Difference]: Start difference. First operand 307 states and 355 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:59:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:11,986 INFO L93 Difference]: Finished difference Result 411 states and 473 transitions. [2024-11-09 11:59:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:59:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-09 11:59:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:11,988 INFO L225 Difference]: With dead ends: 411 [2024-11-09 11:59:11,988 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 11:59:11,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:59:11,989 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:11,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 134 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:59:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 11:59:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 285. [2024-11-09 11:59:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 260 states have (on average 1.1384615384615384) internal successors, (296), 266 states have internal predecessors, (296), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 11:59:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 322 transitions. [2024-11-09 11:59:12,005 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 322 transitions. Word has length 46 [2024-11-09 11:59:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:12,006 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 322 transitions. [2024-11-09 11:59:12,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:59:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 322 transitions. [2024-11-09 11:59:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 11:59:12,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:12,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:12,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 11:59:12,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:12,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:12,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1884112250, now seen corresponding path program 2 times [2024-11-09 11:59:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190996274] [2024-11-09 11:59:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282509608] [2024-11-09 11:59:12,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:12,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:12,224 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:12,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 11:59:12,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:12,276 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:12,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:59:12,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:59:12,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:59:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190996274] [2024-11-09 11:59:12,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:12,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282509608] [2024-11-09 11:59:12,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282509608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:12,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:12,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 11:59:12,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710451543] [2024-11-09 11:59:12,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:12,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:59:12,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:59:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:59:12,775 INFO L87 Difference]: Start difference. First operand 285 states and 322 transitions. Second operand has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:13,577 INFO L93 Difference]: Finished difference Result 450 states and 525 transitions. [2024-11-09 11:59:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:59:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 65 [2024-11-09 11:59:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:13,580 INFO L225 Difference]: With dead ends: 450 [2024-11-09 11:59:13,580 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 11:59:13,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:59:13,581 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 157 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:13,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 286 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:59:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 11:59:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 403. [2024-11-09 11:59:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 372 states have (on average 1.1612903225806452) internal successors, (432), 378 states have internal predecessors, (432), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 11:59:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 470 transitions. [2024-11-09 11:59:13,604 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 470 transitions. Word has length 65 [2024-11-09 11:59:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:13,604 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 470 transitions. [2024-11-09 11:59:13,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.444444444444445) internal successors, (94), 10 states have internal predecessors, (94), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 470 transitions. [2024-11-09 11:59:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:59:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:13,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:13,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:13,806 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,SelfDestructingSolverStorable20 [2024-11-09 11:59:13,807 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1626594472, now seen corresponding path program 2 times [2024-11-09 11:59:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378822818] [2024-11-09 11:59:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:13,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:59:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378822818] [2024-11-09 11:59:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378822818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712090334] [2024-11-09 11:59:13,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:13,959 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:13,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 11:59:14,004 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:14,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:14,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:59:14,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:59:14,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712090334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:14,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:14,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2024-11-09 11:59:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357109587] [2024-11-09 11:59:14,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:59:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:59:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:59:14,234 INFO L87 Difference]: Start difference. First operand 403 states and 470 transitions. Second operand has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:14,510 INFO L93 Difference]: Finished difference Result 411 states and 474 transitions. [2024-11-09 11:59:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:59:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 67 [2024-11-09 11:59:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:14,513 INFO L225 Difference]: With dead ends: 411 [2024-11-09 11:59:14,513 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 11:59:14,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 11:59:14,514 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:14,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 152 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 11:59:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-09 11:59:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 372 states have (on average 1.1505376344086022) internal successors, (428), 378 states have internal predecessors, (428), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 11:59:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 466 transitions. [2024-11-09 11:59:14,542 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 466 transitions. Word has length 67 [2024-11-09 11:59:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:14,543 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 466 transitions. [2024-11-09 11:59:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.1) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 11:59:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 466 transitions. [2024-11-09 11:59:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 11:59:14,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:14,544 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:14,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 11:59:14,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:14,746 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:14,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1718084489, now seen corresponding path program 3 times [2024-11-09 11:59:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:14,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889852368] [2024-11-09 11:59:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:14,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 11:59:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889852368] [2024-11-09 11:59:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889852368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352484934] [2024-11-09 11:59:14,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:59:14,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:14,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:14,931 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:14,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 11:59:14,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:59:14,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:14,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:14,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-09 11:59:15,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:59:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352484934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:59:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:15,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-09 11:59:15,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509957011] [2024-11-09 11:59:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:59:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:59:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:59:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:59:15,093 INFO L87 Difference]: Start difference. First operand 403 states and 466 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:15,186 INFO L93 Difference]: Finished difference Result 411 states and 470 transitions. [2024-11-09 11:59:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:59:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-09 11:59:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:15,188 INFO L225 Difference]: With dead ends: 411 [2024-11-09 11:59:15,188 INFO L226 Difference]: Without dead ends: 404 [2024-11-09 11:59:15,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:59:15,189 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 74 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:15,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 74 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-09 11:59:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 394. [2024-11-09 11:59:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 363 states have (on average 1.140495867768595) internal successors, (414), 369 states have internal predecessors, (414), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 11:59:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 452 transitions. [2024-11-09 11:59:15,211 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 452 transitions. Word has length 90 [2024-11-09 11:59:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:15,212 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 452 transitions. [2024-11-09 11:59:15,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 11:59:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 452 transitions. [2024-11-09 11:59:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 11:59:15,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:15,213 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:15,231 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-09 11:59:15,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:15,414 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 938127955, now seen corresponding path program 1 times [2024-11-09 11:59:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:15,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883245664] [2024-11-09 11:59:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 11:59:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883245664] [2024-11-09 11:59:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883245664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361917421] [2024-11-09 11:59:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:15,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:15,579 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:15,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 11:59:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:15,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:59:15,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 11:59:15,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 11:59:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361917421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:15,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:15,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 11:59:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679197143] [2024-11-09 11:59:15,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:15,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 11:59:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 11:59:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:59:15,947 INFO L87 Difference]: Start difference. First operand 394 states and 452 transitions. Second operand has 15 states, 14 states have (on average 9.928571428571429) internal successors, (139), 15 states have internal predecessors, (139), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:16,546 INFO L93 Difference]: Finished difference Result 1083 states and 1271 transitions. [2024-11-09 11:59:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 11:59:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.928571428571429) internal successors, (139), 15 states have internal predecessors, (139), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 90 [2024-11-09 11:59:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:16,552 INFO L225 Difference]: With dead ends: 1083 [2024-11-09 11:59:16,552 INFO L226 Difference]: Without dead ends: 1057 [2024-11-09 11:59:16,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:59:16,554 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:16,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 255 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:59:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-09 11:59:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 985. [2024-11-09 11:59:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 928 states have (on average 1.1174568965517242) internal successors, (1037), 934 states have internal predecessors, (1037), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 11:59:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1127 transitions. [2024-11-09 11:59:16,623 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1127 transitions. Word has length 90 [2024-11-09 11:59:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:16,623 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1127 transitions. [2024-11-09 11:59:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.928571428571429) internal successors, (139), 15 states have internal predecessors, (139), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1127 transitions. [2024-11-09 11:59:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 11:59:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:16,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:16,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:16,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 11:59:16,826 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1915498629, now seen corresponding path program 1 times [2024-11-09 11:59:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513274260] [2024-11-09 11:59:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513274260] [2024-11-09 11:59:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513274260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056722772] [2024-11-09 11:59:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:16,919 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:16,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 11:59:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:16,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:16,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:17,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056722772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:17,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 11:59:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441963518] [2024-11-09 11:59:17,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:17,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:59:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:59:17,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:17,185 INFO L87 Difference]: Start difference. First operand 985 states and 1127 transitions. Second operand has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:17,457 INFO L93 Difference]: Finished difference Result 1843 states and 2204 transitions. [2024-11-09 11:59:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:59:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 100 [2024-11-09 11:59:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:17,463 INFO L225 Difference]: With dead ends: 1843 [2024-11-09 11:59:17,463 INFO L226 Difference]: Without dead ends: 1841 [2024-11-09 11:59:17,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:17,465 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:17,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2024-11-09 11:59:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1813. [2024-11-09 11:59:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1715 states have (on average 1.103790087463557) internal successors, (1893), 1720 states have internal predecessors, (1893), 87 states have call successors, (87), 5 states have call predecessors, (87), 5 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-09 11:59:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2067 transitions. [2024-11-09 11:59:17,563 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2067 transitions. Word has length 100 [2024-11-09 11:59:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 1813 states and 2067 transitions. [2024-11-09 11:59:17,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2067 transitions. [2024-11-09 11:59:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 11:59:17,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:17,565 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:17,583 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-09 11:59:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:17,766 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:17,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1124255409, now seen corresponding path program 1 times [2024-11-09 11:59:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838258016] [2024-11-09 11:59:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 11:59:17,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838258016] [2024-11-09 11:59:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838258016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651594831] [2024-11-09 11:59:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:17,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:17,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:17,848 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-09 11:59:17,850 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-09 11:59:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:17,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:17,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 78 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:59:18,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 11:59:18,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651594831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:18,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:18,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2024-11-09 11:59:18,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991281507] [2024-11-09 11:59:18,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:18,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:59:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:18,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:59:18,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:59:18,099 INFO L87 Difference]: Start difference. First operand 1813 states and 2067 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 11:59:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:18,572 INFO L93 Difference]: Finished difference Result 2907 states and 3356 transitions. [2024-11-09 11:59:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 11:59:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 103 [2024-11-09 11:59:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:18,580 INFO L225 Difference]: With dead ends: 2907 [2024-11-09 11:59:18,580 INFO L226 Difference]: Without dead ends: 2354 [2024-11-09 11:59:18,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:59:18,584 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 170 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:18,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 288 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:59:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-11-09 11:59:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1956. [2024-11-09 11:59:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1850 states have (on average 1.1021621621621622) internal successors, (2039), 1855 states have internal predecessors, (2039), 95 states have call successors, (95), 5 states have call predecessors, (95), 5 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-09 11:59:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2229 transitions. [2024-11-09 11:59:18,714 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2229 transitions. Word has length 103 [2024-11-09 11:59:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:18,715 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2229 transitions. [2024-11-09 11:59:18,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 11:59:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2229 transitions. [2024-11-09 11:59:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 11:59:18,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:18,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:18,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 11:59:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:18,917 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:18,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1977386885, now seen corresponding path program 1 times [2024-11-09 11:59:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:18,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75903015] [2024-11-09 11:59:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75903015] [2024-11-09 11:59:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75903015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820944958] [2024-11-09 11:59:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:19,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:19,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:19,007 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:19,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 11:59:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:19,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:59:19,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:19,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 11:59:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820944958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:19,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:19,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 11:59:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796001279] [2024-11-09 11:59:19,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:19,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:59:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:19,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:59:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:19,275 INFO L87 Difference]: Start difference. First operand 1956 states and 2229 transitions. Second operand has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:19,558 INFO L93 Difference]: Finished difference Result 2895 states and 3350 transitions. [2024-11-09 11:59:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:59:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 103 [2024-11-09 11:59:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:19,569 INFO L225 Difference]: With dead ends: 2895 [2024-11-09 11:59:19,569 INFO L226 Difference]: Without dead ends: 2894 [2024-11-09 11:59:19,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:59:19,572 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:19,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 263 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2024-11-09 11:59:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2846. [2024-11-09 11:59:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2693 states have (on average 1.1188265874489418) internal successors, (3013), 2698 states have internal predecessors, (3013), 142 states have call successors, (142), 5 states have call predecessors, (142), 5 states have return successors, (142), 142 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-09 11:59:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3297 transitions. [2024-11-09 11:59:19,716 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3297 transitions. Word has length 103 [2024-11-09 11:59:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 2846 states and 3297 transitions. [2024-11-09 11:59:19,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.7) internal successors, (167), 11 states have internal predecessors, (167), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3297 transitions. [2024-11-09 11:59:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 11:59:19,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:19,719 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:19,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 11:59:19,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:19,920 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:19,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash 195229521, now seen corresponding path program 1 times [2024-11-09 11:59:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:19,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099653296] [2024-11-09 11:59:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 58 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:59:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099653296] [2024-11-09 11:59:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099653296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258873886] [2024-11-09 11:59:20,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:20,081 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:20,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 11:59:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:20,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 11:59:20,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:59:20,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 11:59:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258873886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:20,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-09 11:59:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049810407] [2024-11-09 11:59:20,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 11:59:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 11:59:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:59:20,462 INFO L87 Difference]: Start difference. First operand 2846 states and 3297 transitions. Second operand has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:20,906 INFO L93 Difference]: Finished difference Result 5713 states and 6731 transitions. [2024-11-09 11:59:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:59:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 134 [2024-11-09 11:59:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:20,921 INFO L225 Difference]: With dead ends: 5713 [2024-11-09 11:59:20,921 INFO L226 Difference]: Without dead ends: 4294 [2024-11-09 11:59:20,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 273 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:59:20,926 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 75 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:20,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 380 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2024-11-09 11:59:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 3114. [2024-11-09 11:59:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2947 states have (on average 1.1153715643026807) internal successors, (3287), 2952 states have internal predecessors, (3287), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-09 11:59:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3599 transitions. [2024-11-09 11:59:21,107 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3599 transitions. Word has length 134 [2024-11-09 11:59:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:21,108 INFO L471 AbstractCegarLoop]: Abstraction has 3114 states and 3599 transitions. [2024-11-09 11:59:21,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 11:59:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3599 transitions. [2024-11-09 11:59:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 11:59:21,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:21,111 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:21,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:21,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 11:59:21,312 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:21,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1924404516, now seen corresponding path program 2 times [2024-11-09 11:59:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912443791] [2024-11-09 11:59:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 11:59:21,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912443791] [2024-11-09 11:59:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912443791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:21,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633937424] [2024-11-09 11:59:21,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:21,612 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 11:59:21,681 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:21,682 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:21,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:59:21,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 337 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:59:21,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-09 11:59:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633937424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:22,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 22 [2024-11-09 11:59:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646466724] [2024-11-09 11:59:22,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 11:59:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 11:59:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:59:22,177 INFO L87 Difference]: Start difference. First operand 3114 states and 3599 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-09 11:59:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:22,643 INFO L93 Difference]: Finished difference Result 4976 states and 5727 transitions. [2024-11-09 11:59:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 11:59:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 157 [2024-11-09 11:59:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:22,660 INFO L225 Difference]: With dead ends: 4976 [2024-11-09 11:59:22,660 INFO L226 Difference]: Without dead ends: 4968 [2024-11-09 11:59:22,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 315 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:59:22,664 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 144 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:22,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 465 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4968 states. [2024-11-09 11:59:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4968 to 4909. [2024-11-09 11:59:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4909 states, 4656 states have (on average 1.0914948453608246) internal successors, (5082), 4662 states have internal predecessors, (5082), 236 states have call successors, (236), 11 states have call predecessors, (236), 11 states have return successors, (236), 235 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-09 11:59:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4909 states to 4909 states and 5554 transitions. [2024-11-09 11:59:22,960 INFO L78 Accepts]: Start accepts. Automaton has 4909 states and 5554 transitions. Word has length 157 [2024-11-09 11:59:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 4909 states and 5554 transitions. [2024-11-09 11:59:22,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 10 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-09 11:59:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4909 states and 5554 transitions. [2024-11-09 11:59:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 11:59:22,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:22,966 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:22,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 11:59:23,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 11:59:23,171 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:23,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1924404934, now seen corresponding path program 1 times [2024-11-09 11:59:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723222684] [2024-11-09 11:59:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137150632] [2024-11-09 11:59:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:23,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:23,196 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:23,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 11:59:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:23,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 11:59:23,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 15 proven. 289 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 11:59:23,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723222684] [2024-11-09 11:59:24,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137150632] [2024-11-09 11:59:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137150632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:24,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-09 11:59:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422576392] [2024-11-09 11:59:24,457 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:24,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:59:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:59:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:59:24,459 INFO L87 Difference]: Start difference. First operand 4909 states and 5554 transitions. Second operand has 18 states, 17 states have (on average 7.411764705882353) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:25,498 INFO L93 Difference]: Finished difference Result 5281 states and 5979 transitions. [2024-11-09 11:59:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 11:59:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.411764705882353) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 157 [2024-11-09 11:59:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:25,518 INFO L225 Difference]: With dead ends: 5281 [2024-11-09 11:59:25,519 INFO L226 Difference]: Without dead ends: 5277 [2024-11-09 11:59:25,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:59:25,521 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 83 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:25,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 723 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 11:59:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2024-11-09 11:59:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 4918. [2024-11-09 11:59:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4918 states, 4664 states have (on average 1.0917667238421955) internal successors, (5092), 4670 states have internal predecessors, (5092), 237 states have call successors, (237), 11 states have call predecessors, (237), 11 states have return successors, (237), 236 states have call predecessors, (237), 237 states have call successors, (237) [2024-11-09 11:59:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 5566 transitions. [2024-11-09 11:59:25,810 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 5566 transitions. Word has length 157 [2024-11-09 11:59:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:25,811 INFO L471 AbstractCegarLoop]: Abstraction has 4918 states and 5566 transitions. [2024-11-09 11:59:25,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.411764705882353) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 5566 transitions. [2024-11-09 11:59:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 11:59:25,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:25,814 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:25,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:26,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:26,015 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash -111175832, now seen corresponding path program 2 times [2024-11-09 11:59:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654107691] [2024-11-09 11:59:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002899188] [2024-11-09 11:59:26,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:26,038 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:26,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 11:59:26,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:26,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:26,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:59:26,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 11:59:26,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 11:59:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654107691] [2024-11-09 11:59:26,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002899188] [2024-11-09 11:59:26,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002899188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:26,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:26,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-09 11:59:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973929481] [2024-11-09 11:59:26,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:26,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:59:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:59:26,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:59:26,940 INFO L87 Difference]: Start difference. First operand 4918 states and 5566 transitions. Second operand has 14 states, 13 states have (on average 14.307692307692308) internal successors, (186), 14 states have internal predecessors, (186), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 11:59:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:28,978 INFO L93 Difference]: Finished difference Result 6350 states and 7240 transitions. [2024-11-09 11:59:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 11:59:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.307692307692308) internal successors, (186), 14 states have internal predecessors, (186), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 157 [2024-11-09 11:59:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:28,996 INFO L225 Difference]: With dead ends: 6350 [2024-11-09 11:59:28,996 INFO L226 Difference]: Without dead ends: 6328 [2024-11-09 11:59:29,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-11-09 11:59:29,000 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 309 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:29,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 525 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 11:59:29,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2024-11-09 11:59:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6160. [2024-11-09 11:59:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6160 states, 5839 states have (on average 1.0972769309813324) internal successors, (6407), 5847 states have internal predecessors, (6407), 304 states have call successors, (304), 11 states have call predecessors, (304), 11 states have return successors, (304), 301 states have call predecessors, (304), 304 states have call successors, (304) [2024-11-09 11:59:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6160 states to 6160 states and 7015 transitions. [2024-11-09 11:59:29,319 INFO L78 Accepts]: Start accepts. Automaton has 6160 states and 7015 transitions. Word has length 157 [2024-11-09 11:59:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:29,319 INFO L471 AbstractCegarLoop]: Abstraction has 6160 states and 7015 transitions. [2024-11-09 11:59:29,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.307692307692308) internal successors, (186), 14 states have internal predecessors, (186), 9 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-09 11:59:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6160 states and 7015 transitions. [2024-11-09 11:59:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 11:59:29,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:29,323 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:29,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:29,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:29,524 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1837625658, now seen corresponding path program 3 times [2024-11-09 11:59:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:29,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311092620] [2024-11-09 11:59:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044839631] [2024-11-09 11:59:29,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:59:29,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:29,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:29,548 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:29,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 11:59:29,607 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 11:59:29,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:29,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:59:29,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 131 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-09 11:59:29,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311092620] [2024-11-09 11:59:29,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044839631] [2024-11-09 11:59:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044839631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:29,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-09 11:59:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657285958] [2024-11-09 11:59:29,949 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:59:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:59:29,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:59:29,950 INFO L87 Difference]: Start difference. First operand 6160 states and 7015 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:59:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:30,154 INFO L93 Difference]: Finished difference Result 6943 states and 7932 transitions. [2024-11-09 11:59:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:59:30,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-11-09 11:59:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:30,165 INFO L225 Difference]: With dead ends: 6943 [2024-11-09 11:59:30,165 INFO L226 Difference]: Without dead ends: 4313 [2024-11-09 11:59:30,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:59:30,171 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:30,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 104 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:59:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2024-11-09 11:59:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4300. [2024-11-09 11:59:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4300 states, 4064 states have (on average 1.1043307086614174) internal successors, (4488), 4073 states have internal predecessors, (4488), 219 states have call successors, (219), 11 states have call predecessors, (219), 11 states have return successors, (219), 215 states have call predecessors, (219), 219 states have call successors, (219) [2024-11-09 11:59:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 4926 transitions. [2024-11-09 11:59:30,376 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 4926 transitions. Word has length 157 [2024-11-09 11:59:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 4300 states and 4926 transitions. [2024-11-09 11:59:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:59:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 4926 transitions. [2024-11-09 11:59:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 11:59:30,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:30,379 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:30,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-09 11:59:30,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:30,580 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:30,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2333843, now seen corresponding path program 2 times [2024-11-09 11:59:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640667965] [2024-11-09 11:59:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 18 proven. 431 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 11:59:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640667965] [2024-11-09 11:59:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640667965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284977339] [2024-11-09 11:59:30,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:30,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:30,888 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:30,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 11:59:30,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:30,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:30,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 11:59:30,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 18 proven. 431 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 11:59:31,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 18 proven. 431 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 11:59:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284977339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:31,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2024-11-09 11:59:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800345954] [2024-11-09 11:59:31,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 11:59:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 11:59:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:59:31,468 INFO L87 Difference]: Start difference. First operand 4300 states and 4926 transitions. Second operand has 23 states, 22 states have (on average 12.863636363636363) internal successors, (283), 23 states have internal predecessors, (283), 15 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-09 11:59:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:32,653 INFO L93 Difference]: Finished difference Result 9197 states and 10610 transitions. [2024-11-09 11:59:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-09 11:59:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 12.863636363636363) internal successors, (283), 23 states have internal predecessors, (283), 15 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 182 [2024-11-09 11:59:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:32,672 INFO L225 Difference]: With dead ends: 9197 [2024-11-09 11:59:32,672 INFO L226 Difference]: Without dead ends: 9175 [2024-11-09 11:59:32,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1046, Invalid=2260, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 11:59:32,678 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 304 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:32,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 292 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:59:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9175 states. [2024-11-09 11:59:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9175 to 8905. [2024-11-09 11:59:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8905 states, 8458 states have (on average 1.0664459683140222) internal successors, (9020), 8464 states have internal predecessors, (9020), 430 states have call successors, (430), 11 states have call predecessors, (430), 11 states have return successors, (430), 429 states have call predecessors, (430), 430 states have call successors, (430) [2024-11-09 11:59:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8905 states to 8905 states and 9880 transitions. [2024-11-09 11:59:33,140 INFO L78 Accepts]: Start accepts. Automaton has 8905 states and 9880 transitions. Word has length 182 [2024-11-09 11:59:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:33,140 INFO L471 AbstractCegarLoop]: Abstraction has 8905 states and 9880 transitions. [2024-11-09 11:59:33,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 12.863636363636363) internal successors, (283), 23 states have internal predecessors, (283), 15 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-09 11:59:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8905 states and 9880 transitions. [2024-11-09 11:59:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-09 11:59:33,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:33,144 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:33,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-09 11:59:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 11:59:33,349 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1047457370, now seen corresponding path program 3 times [2024-11-09 11:59:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811943220] [2024-11-09 11:59:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:59:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 177 proven. 355 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-09 11:59:33,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811943220] [2024-11-09 11:59:33,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811943220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705406974] [2024-11-09 11:59:33,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:59:33,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:33,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:33,619 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:33,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-09 11:59:33,685 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-09 11:59:33,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:33,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:59:33,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 358 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-09 11:59:33,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705406974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:34,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:59:34,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2024-11-09 11:59:34,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769061448] [2024-11-09 11:59:34,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:59:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:59:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-09 11:59:34,307 INFO L87 Difference]: Start difference. First operand 8905 states and 9880 transitions. Second operand has 17 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 11:59:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:35,858 INFO L93 Difference]: Finished difference Result 14275 states and 16058 transitions. [2024-11-09 11:59:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 11:59:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 203 [2024-11-09 11:59:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:35,881 INFO L225 Difference]: With dead ends: 14275 [2024-11-09 11:59:35,881 INFO L226 Difference]: Without dead ends: 11003 [2024-11-09 11:59:35,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:59:35,892 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 240 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:35,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1551 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 11:59:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11003 states. [2024-11-09 11:59:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11003 to 9882. [2024-11-09 11:59:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9882 states, 9385 states have (on average 1.0627597229621737) internal successors, (9974), 9391 states have internal predecessors, (9974), 480 states have call successors, (480), 11 states have call predecessors, (480), 11 states have return successors, (480), 479 states have call predecessors, (480), 480 states have call successors, (480) [2024-11-09 11:59:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9882 states to 9882 states and 10934 transitions. [2024-11-09 11:59:36,572 INFO L78 Accepts]: Start accepts. Automaton has 9882 states and 10934 transitions. Word has length 203 [2024-11-09 11:59:36,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:36,576 INFO L471 AbstractCegarLoop]: Abstraction has 9882 states and 10934 transitions. [2024-11-09 11:59:36,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.294117647058824) internal successors, (243), 17 states have internal predecessors, (243), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-09 11:59:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 9882 states and 10934 transitions. [2024-11-09 11:59:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 11:59:36,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:36,581 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:36,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:36,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 11:59:36,782 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:36,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash -295614854, now seen corresponding path program 2 times [2024-11-09 11:59:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60744089] [2024-11-09 11:59:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:59:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-09 11:59:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 644 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60744089] [2024-11-09 11:59:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60744089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336414898] [2024-11-09 11:59:36,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:36,983 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:36,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-09 11:59:37,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:37,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:37,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:59:37,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 644 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:37,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 644 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336414898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:37,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-09 11:59:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115658681] [2024-11-09 11:59:37,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:37,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 11:59:37,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 11:59:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:59:37,560 INFO L87 Difference]: Start difference. First operand 9882 states and 10934 transitions. Second operand has 21 states, 20 states have (on average 17.05) internal successors, (341), 21 states have internal predecessors, (341), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-09 11:59:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:38,221 INFO L93 Difference]: Finished difference Result 13244 states and 15123 transitions. [2024-11-09 11:59:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 11:59:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 17.05) internal successors, (341), 21 states have internal predecessors, (341), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 215 [2024-11-09 11:59:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:38,253 INFO L225 Difference]: With dead ends: 13244 [2024-11-09 11:59:38,253 INFO L226 Difference]: Without dead ends: 13243 [2024-11-09 11:59:38,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:59:38,260 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 128 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:38,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 339 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13243 states. [2024-11-09 11:59:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13243 to 13175. [2024-11-09 11:59:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13175 states, 12506 states have (on average 1.0845993922916999) internal successors, (13564), 12512 states have internal predecessors, (13564), 652 states have call successors, (652), 11 states have call predecessors, (652), 11 states have return successors, (652), 651 states have call predecessors, (652), 652 states have call successors, (652) [2024-11-09 11:59:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13175 states to 13175 states and 14868 transitions. [2024-11-09 11:59:39,034 INFO L78 Accepts]: Start accepts. Automaton has 13175 states and 14868 transitions. Word has length 215 [2024-11-09 11:59:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:39,035 INFO L471 AbstractCegarLoop]: Abstraction has 13175 states and 14868 transitions. [2024-11-09 11:59:39,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 17.05) internal successors, (341), 21 states have internal predecessors, (341), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-09 11:59:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 13175 states and 14868 transitions. [2024-11-09 11:59:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 11:59:39,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:39,042 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:39,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-09 11:59:39,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 11:59:39,243 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:39,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1820811666, now seen corresponding path program 2 times [2024-11-09 11:59:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205476267] [2024-11-09 11:59:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:59:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-09 11:59:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:39,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205476267] [2024-11-09 11:59:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205476267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933642164] [2024-11-09 11:59:39,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:59:39,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:39,537 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:39,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 11:59:39,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:59:39,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:39,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 11:59:39,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:39,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:40,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933642164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:40,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:40,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-09 11:59:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137145028] [2024-11-09 11:59:40,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:40,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 11:59:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 11:59:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:59:40,187 INFO L87 Difference]: Start difference. First operand 13175 states and 14868 transitions. Second operand has 21 states, 20 states have (on average 17.35) internal successors, (347), 21 states have internal predecessors, (347), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-09 11:59:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:41,070 INFO L93 Difference]: Finished difference Result 18211 states and 20874 transitions. [2024-11-09 11:59:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 11:59:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 17.35) internal successors, (347), 21 states have internal predecessors, (347), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) Word has length 218 [2024-11-09 11:59:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:41,103 INFO L225 Difference]: With dead ends: 18211 [2024-11-09 11:59:41,103 INFO L226 Difference]: Without dead ends: 18210 [2024-11-09 11:59:41,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-09 11:59:41,110 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 414 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:41,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 407 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18210 states. [2024-11-09 11:59:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18210 to 18092. [2024-11-09 11:59:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18092 states, 17164 states have (on average 1.1018410626893498) internal successors, (18912), 17169 states have internal predecessors, (18912), 911 states have call successors, (911), 11 states have call predecessors, (911), 11 states have return successors, (911), 911 states have call predecessors, (911), 911 states have call successors, (911) [2024-11-09 11:59:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 20734 transitions. [2024-11-09 11:59:42,057 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 20734 transitions. Word has length 218 [2024-11-09 11:59:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 18092 states and 20734 transitions. [2024-11-09 11:59:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 17.35) internal successors, (347), 21 states have internal predecessors, (347), 20 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 20 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-09 11:59:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 20734 transitions. [2024-11-09 11:59:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-09 11:59:42,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:42,063 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:42,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:42,264 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:42,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1266803891, now seen corresponding path program 4 times [2024-11-09 11:59:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934051874] [2024-11-09 11:59:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:59:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-09 11:59:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 183 proven. 499 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934051874] [2024-11-09 11:59:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934051874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469417000] [2024-11-09 11:59:42,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:59:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:42,579 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:42,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 11:59:42,667 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:59:42,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:42,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 11:59:42,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 232 proven. 450 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:42,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 232 proven. 450 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 11:59:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469417000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:43,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-09 11:59:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000764246] [2024-11-09 11:59:43,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:43,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:59:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:59:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:59:43,158 INFO L87 Difference]: Start difference. First operand 18092 states and 20734 transitions. Second operand has 18 states, 18 states have (on average 15.777777777777779) internal successors, (284), 18 states have internal predecessors, (284), 16 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-09 11:59:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:44,710 INFO L93 Difference]: Finished difference Result 32308 states and 37786 transitions. [2024-11-09 11:59:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 11:59:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.777777777777779) internal successors, (284), 18 states have internal predecessors, (284), 16 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) Word has length 226 [2024-11-09 11:59:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:44,760 INFO L225 Difference]: With dead ends: 32308 [2024-11-09 11:59:44,760 INFO L226 Difference]: Without dead ends: 24155 [2024-11-09 11:59:44,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 459 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2024-11-09 11:59:44,784 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:44,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 738 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:59:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24155 states. [2024-11-09 11:59:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24155 to 17975. [2024-11-09 11:59:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17975 states, 17052 states have (on average 1.099988271170537) internal successors, (18757), 17057 states have internal predecessors, (18757), 906 states have call successors, (906), 11 states have call predecessors, (906), 11 states have return successors, (906), 906 states have call predecessors, (906), 906 states have call successors, (906) [2024-11-09 11:59:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17975 states to 17975 states and 20569 transitions. [2024-11-09 11:59:45,847 INFO L78 Accepts]: Start accepts. Automaton has 17975 states and 20569 transitions. Word has length 226 [2024-11-09 11:59:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:45,848 INFO L471 AbstractCegarLoop]: Abstraction has 17975 states and 20569 transitions. [2024-11-09 11:59:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.777777777777779) internal successors, (284), 18 states have internal predecessors, (284), 16 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-09 11:59:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 17975 states and 20569 transitions. [2024-11-09 11:59:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 11:59:45,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:45,854 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:45,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:46,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 11:59:46,059 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:46,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1469583004, now seen corresponding path program 3 times [2024-11-09 11:59:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182918362] [2024-11-09 11:59:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:59:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810144362] [2024-11-09 11:59:46,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:59:46,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:46,090 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:46,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-09 11:59:46,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 11:59:46,173 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:46,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 11:59:46,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-09 11:59:46,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182918362] [2024-11-09 11:59:46,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:59:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810144362] [2024-11-09 11:59:46,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810144362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:46,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:59:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-09 11:59:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126239994] [2024-11-09 11:59:46,890 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:59:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:59:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:59:46,891 INFO L87 Difference]: Start difference. First operand 17975 states and 20569 transitions. Second operand has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:48,162 INFO L93 Difference]: Finished difference Result 25540 states and 29589 transitions. [2024-11-09 11:59:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 11:59:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 249 [2024-11-09 11:59:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:48,187 INFO L225 Difference]: With dead ends: 25540 [2024-11-09 11:59:48,187 INFO L226 Difference]: Without dead ends: 18985 [2024-11-09 11:59:48,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2024-11-09 11:59:48,200 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 128 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:48,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 763 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:59:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18985 states. [2024-11-09 11:59:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18985 to 17917. [2024-11-09 11:59:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17917 states, 16998 states have (on average 1.0997764442875633) internal successors, (18694), 17003 states have internal predecessors, (18694), 902 states have call successors, (902), 11 states have call predecessors, (902), 11 states have return successors, (902), 902 states have call predecessors, (902), 902 states have call successors, (902) [2024-11-09 11:59:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17917 states to 17917 states and 20498 transitions. [2024-11-09 11:59:48,922 INFO L78 Accepts]: Start accepts. Automaton has 17917 states and 20498 transitions. Word has length 249 [2024-11-09 11:59:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:48,923 INFO L471 AbstractCegarLoop]: Abstraction has 17917 states and 20498 transitions. [2024-11-09 11:59:48,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 7 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 11:59:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 17917 states and 20498 transitions. [2024-11-09 11:59:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-09 11:59:48,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:59:48,934 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:48,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 11:59:49,135 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 11:59:49,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:59:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 440859760, now seen corresponding path program 4 times [2024-11-09 11:59:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:59:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461214799] [2024-11-09 11:59:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:59:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:59:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:59:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:59:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 11:59:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 11:59:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:59:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 11:59:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 11:59:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 11:59:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 11:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:59:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-09 11:59:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-09 11:59:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-09 11:59:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-09 11:59:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:59:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1211 proven. 11 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 11:59:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:59:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461214799] [2024-11-09 11:59:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461214799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:59:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354697009] [2024-11-09 11:59:49,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 11:59:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:59:49,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:59:49,780 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:59:49,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 11:59:49,876 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 11:59:49,876 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:59:49,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 11:59:49,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:59:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1457 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:59:50,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:59:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1197 proven. 10 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-09 11:59:50,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354697009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:59:50,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:59:50,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 26 [2024-11-09 11:59:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978551580] [2024-11-09 11:59:50,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:59:50,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 11:59:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:59:50,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 11:59:50,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:59:50,457 INFO L87 Difference]: Start difference. First operand 17917 states and 20498 transitions. Second operand has 26 states, 26 states have (on average 10.576923076923077) internal successors, (275), 26 states have internal predecessors, (275), 13 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-09 11:59:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:59:50,984 INFO L93 Difference]: Finished difference Result 17921 states and 20501 transitions. [2024-11-09 11:59:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 11:59:50,984 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.576923076923077) internal successors, (275), 26 states have internal predecessors, (275), 13 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) Word has length 295 [2024-11-09 11:59:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:59:50,990 INFO L225 Difference]: With dead ends: 17921 [2024-11-09 11:59:50,990 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:59:51,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 596 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=731, Invalid=1525, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 11:59:51,014 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 87 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:59:51,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1657 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:59:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:59:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:59:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:59:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:59:51,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2024-11-09 11:59:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:59:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:59:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.576923076923077) internal successors, (275), 26 states have internal predecessors, (275), 13 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-09 11:59:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:59:51,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:59:51,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-09 11:59:51,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-09 11:59:51,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-09 11:59:51,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-09 11:59:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 11:59:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 11:59:51,229 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:59:51,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:00:03,670 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 352 DAG size of output: 216 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 12:00:11,334 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 442 DAG size of output: 244 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-09 12:00:11,350 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:00:11,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:00:11 BoogieIcfgContainer [2024-11-09 12:00:11,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:00:11,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:00:11,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:00:11,472 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:00:11,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:59:00" (3/4) ... [2024-11-09 12:00:11,477 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:00:11,482 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 12:00:11,482 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:00:11,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 12:00:11,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:00:11,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:00:11,487 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:00:11,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:00:11,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:00:11,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:00:11,619 INFO L158 Benchmark]: Toolchain (without parser) took 71744.70ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 83.2MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 272.2MB. Max. memory is 16.1GB. [2024-11-09 12:00:11,619 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:00:11,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 70.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:00:11,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.30ms. Allocated memory is still 155.2MB. Free memory was 70.6MB in the beginning and 69.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:00:11,619 INFO L158 Benchmark]: Boogie Preprocessor took 52.64ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:00:11,620 INFO L158 Benchmark]: RCFGBuilder took 467.25ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 67.4MB in the beginning and 172.6MB in the end (delta: -105.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-09 12:00:11,620 INFO L158 Benchmark]: TraceAbstraction took 70771.88ms. Allocated memory was 209.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 171.6MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-09 12:00:11,620 INFO L158 Benchmark]: Witness Printer took 147.02ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 12:00:11,621 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.13ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 70.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.30ms. Allocated memory is still 155.2MB. Free memory was 70.6MB in the beginning and 69.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.64ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 467.25ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 67.4MB in the beginning and 172.6MB in the end (delta: -105.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 70771.88ms. Allocated memory was 209.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 171.6MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 147.02ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 69 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 50.4s, OverallIterations: 39, TraceHistogramMax: 13, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4093 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4071 mSDsluCounter, 11997 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9695 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12219 IncrementalHoareTripleChecker+Invalid, 12531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 2302 mSDtfsCounter, 12219 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6399 GetRequests, 5781 SyntacticMatches, 52 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3378 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18092occurred in iteration=36, InterpolantAutomatonStates: 498, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 11354 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 7028 NumberOfCodeBlocks, 6706 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 8208 ConstructedInterpolants, 7 QuantifiedInterpolants, 28882 SizeOfPredicates, 65 NumberOfNonLiveVariables, 5650 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 77 InterpolantComputations, 14 PerfectInterpolantSequences, 9453/20842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= x1) && (2 == y1)) && (2 == x2)) && (counter == 4)) && (y2 == 0)) && (x1 <= ((long long) y3 + 4))) && (y3 <= 2147483643)) && (0 <= y3)) || ((((((((((0 <= x1) && (counter == 4)) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x2 <= 715827882)) && (x1 <= ((long long) y3 + 4))) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((x2 <= 2147483647) && (y2 == 0)) && (x1 == y3)) && (y1 == 0)) && (counter == 0)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 == 1)) && (3 <= x2)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (counter == 9)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == y1)) && (y3 <= 2147483638)) && (3 == x2)) && (3 == y2)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 10)) && (y2 <= 7)) && (y1 == 1)) && (x1 <= ((long long) 2147483643 + y3))) && (x2 <= 715827882)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (3 <= x2)) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (counter == 8)) && (2 == y2)) && (y1 == 1)) && (x2 <= 2147483644)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 10)) && (x1 <= ((long long) 2147483643 + y3))) && (y2 == 1)) && (3 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || (((((((((0 <= x1) && (y2 == 4)) && (counter == 10)) && (2 == x2)) && (x1 <= ((long long) 2147483643 + y3))) && (y3 <= 2147483637)) && (3 == y1)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 7)) && (x2 == 1)) && (y1 <= 7)) && (y2 == 0)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (2 == y2)) && (y1 == 1)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (5 == x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 8)) && (2 == x2)) && (y1 == 1)) && (y2 <= 6)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (4 <= y2)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == x2)) && (y3 <= 2147483638)) && (3 == y2)) && (counter == 9)) && (3 == y1)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (0 <= y3))) || (((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 <= 2147483638)) && (counter == 9)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (counter == 5)) && (y2 == 0)) && (x1 <= ((long long) 5 + y3))) && (y1 <= 5)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 == y2)) && (3 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483645)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 8)) && (y1 == 1)) && (3 == y2)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (y3 <= 2147483639)) && (5 == x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 3)) && (x2 == 1)) && (y2 == 0)) && (x1 <= ((long long) 3 + y3))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 5)) && (y2 <= 5)) && (y1 == 0)) && (x1 <= ((long long) 5 + y3))) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 3)) && (x2 <= 2147483647)) && (y1 == 0)) && (3 == y2)) && (x1 <= ((long long) 3 + y3))) && (y3 <= 2147483644)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 8)) && (x2 <= 2147483647)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (4 <= y2)) && (y2 <= 8)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 10)) && (x2 <= 2147483647)) && (x1 <= ((long long) 2147483643 + y3))) && (y1 == 0)) && (y2 <= 2147483639)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 10)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (x1 <= ((long long) 2147483643 + y3))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 7)) && (((long long) x2 + y3) <= 2147483646)) && (x2 <= 6)) && (y1 == 1)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (y2 <= 5)) && (2 == x2)) && (counter == 9)) && (x1 <= 2147483647)) && (((long long) y2 + y3) <= 2147483643)) && (x1 <= ((long long) y3 + 2147483642))) && (4 <= y2)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (counter == 8)) && (y2 == 0)) && (y1 <= 8)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 10)) && (2 == y2)) && ((((long long) x2 * y1) + ((long long) 3 * x2)) <= 2147483647)) && (1 <= x2)) && (x1 <= ((long long) 2147483643 + y3))) && ((((long long) x2 * y1) + y3) <= 2147483645)) && (x1 <= 2147483647)) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (x1 <= ((long long) 6 + y3))) && (y1 == 1)) && (x2 <= 5)) && (3 <= x2)) && (counter == 6)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 <= 2147483647)) && (y2 <= 2147483638)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (4 <= y2)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (counter == 8)) && (y2 == 0)) && ((((long long) x2 * y1) + ((long long) 3 * x2)) <= 2147483647)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 <= 5)) && (y1 == 1)) && (x2 <= 715827882)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (3 <= x2)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (4 <= y2)) && (0 <= y3))) || ((((((((0 <= x1) && (x1 <= ((long long) 6 + y3))) && (y1 == 1)) && (y2 == 1)) && (counter == 6)) && (5 == x2)) && (y3 <= 2147483641)) && (0 <= y3))) || ((((((((0 <= x1) && (x1 <= ((long long) 6 + y3))) && (2 == x2)) && (y2 == 0)) && (counter == 6)) && (3 == y1)) && (y3 <= 2147483641)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) 6 + y3))) && (x2 <= 2147483647)) && (y1 == 0)) && (y2 <= 6)) && (counter == 6)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (counter == 2)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (2 == x2)) && (y2 == 1)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483640))) && (3 == y1)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == y2)) && (2 == x2)) && (counter == 9)) && (3 == y1)) && (x1 <= 2147483647)) && (y3 <= 2147483639)) && (x1 <= ((long long) y3 + 2147483642))) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y2)) && (counter == 5)) && (y1 == 1)) && (3 == x2)) && (y3 <= 2147483642)) && (x1 <= ((long long) 5 + y3))) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 3)) && (2 == x2)) && (y1 == 1)) && (y2 == 1)) && (x1 <= ((long long) 3 + y3))) && (y3 <= 2147483644)) && (0 <= y3))) || ((((((((((0 <= x1) && (y2 == 4)) && (counter == 8)) && (y1 == 1)) && (x2 <= 715827882)) && (3 <= x2)) && (((long long) x2 + y3) <= 2147483643)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y1)) && (counter == 5)) && (2 == x2)) && (y3 <= 2147483642)) && (y2 == 1)) && (x1 <= ((long long) 5 + y3))) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 7)) && (((long long) x2 + y3) <= 2147483644)) && (y1 == 1)) && (x2 <= 4)) && (3 == y2)) && (3 <= x2)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (2 == y1)) && (2 == x2)) && (3 == y2)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (counter == 10)) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (y2 == 0)) && (x1 <= ((long long) 2147483643 + y3))) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (y1 <= 5)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (x1 <= ((long long) 6 + y3))) && (y1 == 1)) && (3 == x2)) && (3 == y2)) && (counter == 6)) && (y3 <= 2147483641)) && (0 <= y3))) || ((((((((((0 <= x1) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 7)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (x1 <= ((long long) y3 + 2147483640))) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y2)) && (2 == x2)) && (counter == 4)) && (y1 == 1)) && (x1 <= ((long long) y3 + 4))) && (y3 <= 2147483643)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (y1 <= 6)) && (x1 <= ((long long) 6 + y3))) && (y2 == 0)) && (counter == 6)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 10)) && (y2 == 0)) && (x1 <= ((long long) 2147483643 + y3))) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (counter == 8)) && (y1 == 1)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 10)) && ((((long long) x2 * y1) + ((long long) 3 * x2)) <= 2147483647)) && (x1 <= ((long long) 2147483643 + y3))) && (y2 == 1)) && (3 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (y2 == 4)) && (2 == y1)) && (2 <= x2)) && (counter == 10)) && (x1 <= ((long long) 2147483643 + y3))) && ((y3 + ((long long) 2 * x2)) <= 2147483643)) && (x2 <= 3)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (2 == y1)) && (3 == x2)) && (y2 == 1)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 10)) && (((long long) x2 + y3) <= 2147483644)) && (y1 == 1)) && (x1 <= ((long long) 2147483643 + y3))) && (3 == y2)) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 8)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y2)) && (x2 <= 2147483647)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (counter == 2)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 == 0)) && ((((long long) x2 * y1) + ((long long) 3 * x2)) <= 2147483647)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 10)) && (2 == x2)) && (y1 == 1)) && (x1 <= ((long long) 2147483643 + y3))) && (x1 <= 2147483647)) && (4 <= y2)) && (y2 <= 8)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y1)) && (x1 <= ((long long) 6 + y3))) && (y2 == 0)) && (3 == x2)) && (counter == 6)) && (y3 <= 2147483641)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 8)) && (y2 <= 5)) && (((long long) y2 + y3) <= 2147483644)) && (y1 == 1)) && (3 == x2)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (counter == 10)) && (2 == x2)) && (x1 <= ((long long) 2147483643 + y3))) && (y2 <= 6)) && (x1 <= 2147483647)) && (((long long) y2 + y3) <= 2147483643)) && (4 <= y2)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 10)) && (2 == x2)) && (x1 <= ((long long) 2147483643 + y3))) && (y3 <= 2147483638)) && (3 == y2)) && (3 == y1)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 5)) && (y2 == 0)) && (y1 == 1)) && (y3 <= 2147483642)) && (x1 <= ((long long) 5 + y3))) && (5 == x2)) && (0 <= y3))) || ((((((((0 <= x1) && (y2 == 4)) && (x1 <= ((long long) 6 + y3))) && (2 == x2)) && (y1 == 1)) && (counter == 6)) && (y3 <= 2147483641)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == y1)) && (counter == 8)) && (2 == x2)) && (3 == y2)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (x2 == 1)) && (counter == 4)) && (y2 == 0)) && (x1 <= ((long long) y3 + 4))) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 8)) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((0 <= x1) && (y2 == 4)) && (x2 <= 2147483647)) && (counter == 4)) && (x1 <= ((long long) y3 + 4))) && (y1 == 0)) && (y3 <= 2147483643)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 7)) && (y2 == 4)) && (y1 == 1)) && (3 == x2)) && (y3 <= 2147483640)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) y2 + y3) <= 2147483644)) && (y1 == 1)) && (3 == x2)) && (y2 <= 6)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (4 <= y2)) && (0 <= y3))) || (((((((((0 <= x1) && (x2 == 1)) && (counter == 10)) && (y1 <= 2147483639)) && (y2 == 0)) && (x1 <= 2147483647)) && (((long long) y1 + y3) <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == y1)) && (counter == 8)) && (2 == y2)) && (3 == x2)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (y3 <= 2147483639)) && (0 <= y3))) || (((((((((0 <= x1) && (counter == 8)) && (2 == y2)) && (2 == x2)) && (x1 <= ((long long) y3 + 2147483641))) && (3 == y1)) && (x1 <= 2147483647)) && (y3 <= 2147483639)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 8)) && (y2 == 1)) && (3 <= x2)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483641))) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 5)) && (2 == x2)) && (y1 == 1)) && (y3 <= 2147483642)) && (3 == y2)) && (x1 <= ((long long) 5 + y3))) && (0 <= y3))) || ((((((((0 <= x1) && (2 == y1)) && (2 == y2)) && (x1 <= ((long long) 6 + y3))) && (2 == x2)) && (counter == 6)) && (y3 <= 2147483641)) && (0 <= y3))) || (((((((((((0 <= x1) && (counter == 10)) && (2 == y2)) && (x1 <= ((long long) 2147483643 + y3))) && (3 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483645)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483644)) && (y1 == 1)) && (3 == y2)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (5 <= x2)) && (0 <= y3))) || (((((((((((0 <= x1) && ((((long long) x2 * y1) + ((long long) 3 * x2)) <= 2147483647)) && (1 <= x2)) && (y2 == 1)) && (counter == 9)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (y1 <= 4)) && (1 <= y1)) && (0 <= y3))) || ((((((((0 <= x1) && (2 == x2)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (counter == 2)) && (0 <= y3))) || (((((((((0 <= x1) && (x1 <= ((long long) 6 + y3))) && (y2 == 0)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (counter == 6)) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || (((((((((0 <= x1) && (y2 == 4)) && (2 == y1)) && (counter == 8)) && (2 == x2)) && (x1 <= ((long long) y3 + 2147483641))) && (x1 <= 2147483647)) && (y3 <= 2147483639)) && (0 <= y3))) || (((((((((0 <= x1) && (y2 == 4)) && (counter == 10)) && (y1 == 1)) && (x1 <= ((long long) 2147483643 + y3))) && (((long long) x2 + y3) <= 2147483643)) && (x1 <= 2147483647)) && (5 <= x2)) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 3)) && (y2 == 0)) && (y1 == 1)) && (3 == x2)) && (x1 <= ((long long) 3 + y3))) && (y3 <= 2147483644)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 7)) && (x2 <= 2147483647)) && (y2 <= 7)) && (y1 == 0)) && (x1 <= ((long long) y3 + 2147483640))) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (4 <= y2)) && (0 <= y3))) || ((((((((((0 <= x1) && (counter == 7)) && (y2 <= 5)) && (2 == x2)) && (y1 == 1)) && (x1 <= ((long long) y3 + 2147483640))) && (x1 <= 2147483647)) && (4 <= y2)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 == y1)) && (2 == x2)) && (3 == y2)) && (y3 <= 2147483640)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (5 <= x2)) && (0 <= y3))) || ((((((((((0 <= x1) && (y2 <= 7)) && (2 == x2)) && (y1 == 1)) && (counter == 9)) && (x1 <= 2147483647)) && (x1 <= ((long long) y3 + 2147483642))) && (4 <= y2)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (counter == 10)) && ((((long long) x2 * y1) + y3) <= 2147483644)) && (x1 <= ((long long) 2147483643 + y3))) && (3 == y2)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (x2 <= 6)) && (counter == 5)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (x1 <= ((long long) 5 + y3))) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((0 <= x1) && (counter == 4)) && (y1 == 1)) && (3 == x2)) && (x1 <= ((long long) y3 + 4))) && (y2 == 1)) && (y3 <= 2147483643)) && (0 <= y3))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (((((((((((cond != 0) || (counter != 9)) && ((cond != 0) || (counter != 8))) && ((cond != 0) || (counter != 6))) && ((counter != 5) || (cond != 0))) && ((cond != 0) || (counter != 4))) && ((cond != 0) || (counter != 7))) && ((cond != 0) || (counter != 10))) && ((cond != 0) || (counter != 2))) && ((cond != 0) || (counter != 3))) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:00:11,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE