./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3d5962362825282ae42e15c2becb997ecc48fe70f2dab3f327a660cebbeb623f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:47:04,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:47:04,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:47:04,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:47:04,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:47:04,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:47:04,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:47:04,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:47:04,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:47:04,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:47:04,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:47:04,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:47:04,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:47:04,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:47:04,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:47:04,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:47:04,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:47:04,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:47:04,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:47:04,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:47:04,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:47:04,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:47:04,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:47:04,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:47:04,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:47:04,524 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:47:04,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:47:04,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:47:04,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:47:04,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:47:04,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:47:04,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:47:04,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:47:04,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:47:04,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:04,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:47:04,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:47:04,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:47:04,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:47:04,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:47:04,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:47:04,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:47:04,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:47:04,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:47:04,529 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-clean/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-clean/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 -> 3d5962362825282ae42e15c2becb997ecc48fe70f2dab3f327a660cebbeb623f [2024-10-11 20:47:04,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:47:04,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:47:04,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:47:04,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:47:04,785 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:47:04,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2024-10-11 20:47:06,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:47:06,367 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:47:06,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2024-10-11 20:47:06,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a74d0efa7/4a1b130e71d44f9ca92be5459f0e8c10/FLAGa0f41b0a9 [2024-10-11 20:47:06,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a74d0efa7/4a1b130e71d44f9ca92be5459f0e8c10 [2024-10-11 20:47:06,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:47:06,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:47:06,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:06,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:47:06,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:47:06,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dc9b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06, skipping insertion in model container [2024-10-11 20:47:06,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:47:06,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:06,632 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:47:06,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:47:06,676 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:47:06,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06 WrapperNode [2024-10-11 20:47:06,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:47:06,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:06,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:47:06,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:47:06,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,738 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2024-10-11 20:47:06,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:47:06,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:47:06,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:47:06,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:47:06,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:47:06,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:47:06,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:47:06,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:47:06,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:47:06,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (1/1) ... [2024-10-11 20:47:06,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:47:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:06,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:47:06,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:47:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:47:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:47:06,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:47:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:47:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:47:06,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:47:06,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:47:06,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:47:06,952 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:47:06,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:47:07,319 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-11 20:47:07,319 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:47:07,352 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:47:07,353 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:47:07,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:07 BoogieIcfgContainer [2024-10-11 20:47:07,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:47:07,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:47:07,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:47:07,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:47:07,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:47:06" (1/3) ... [2024-10-11 20:47:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bda25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:07, skipping insertion in model container [2024-10-11 20:47:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:47:06" (2/3) ... [2024-10-11 20:47:07,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4bda25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:47:07, skipping insertion in model container [2024-10-11 20:47:07,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:07" (3/3) ... [2024-10-11 20:47:07,362 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound1.c [2024-10-11 20:47:07,378 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:47:07,379 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2024-10-11 20:47:07,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:47:07,454 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;@720223d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:47:07,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-10-11 20:47:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 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-10-11 20:47:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:07,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:07,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:07,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:07,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2141259048, now seen corresponding path program 1 times [2024-10-11 20:47:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193543318] [2024-10-11 20:47:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193543318] [2024-10-11 20:47:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193543318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916546202] [2024-10-11 20:47:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:07,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:47:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:47:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:47:07,664 INFO L87 Difference]: Start difference. First operand has 133 states, 68 states have (on average 1.911764705882353) internal successors, (130), 124 states have internal predecessors, (130), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 20:47:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:07,692 INFO L93 Difference]: Finished difference Result 258 states and 287 transitions. [2024-10-11 20:47:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:47:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 13 [2024-10-11 20:47:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:07,702 INFO L225 Difference]: With dead ends: 258 [2024-10-11 20:47:07,702 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 20:47:07,705 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-10-11 20:47:07,708 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:07,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 20:47:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-11 20:47:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 116 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2024-10-11 20:47:07,754 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 13 [2024-10-11 20:47:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:07,754 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2024-10-11 20:47:07,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-11 20:47:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2024-10-11 20:47:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:47:07,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:07,755 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:47:07,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:07,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1748291620, now seen corresponding path program 1 times [2024-10-11 20:47:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:07,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618511159] [2024-10-11 20:47:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618511159] [2024-10-11 20:47:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618511159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505567310] [2024-10-11 20:47:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:07,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:07,864 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:07,930 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2024-10-11 20:47:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-10-11 20:47:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:07,932 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:47:07,932 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 20:47:07,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 20:47:07,934 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:07,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 20:47:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 20:47:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 112 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2024-10-11 20:47:07,945 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 13 [2024-10-11 20:47:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:07,946 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-10-11 20:47:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2024-10-11 20:47:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:47:07,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:07,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:07,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:47:07,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:07,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1637534589, now seen corresponding path program 1 times [2024-10-11 20:47:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:07,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698435537] [2024-10-11 20:47:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:47:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:08,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698435537] [2024-10-11 20:47:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698435537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:08,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:08,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106939615] [2024-10-11 20:47:08,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:08,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:08,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:08,044 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:08,102 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2024-10-11 20:47:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:47:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:08,104 INFO L225 Difference]: With dead ends: 120 [2024-10-11 20:47:08,104 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 20:47:08,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-11 20:47:08,106 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:08,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 20:47:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 20:47:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 108 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2024-10-11 20:47:08,117 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 14 [2024-10-11 20:47:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:08,117 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2024-10-11 20:47:08,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:47:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2024-10-11 20:47:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:47:08,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:08,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:08,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:47:08,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:08,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -940276409, now seen corresponding path program 1 times [2024-10-11 20:47:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:08,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136673955] [2024-10-11 20:47:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:08,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033041222] [2024-10-11 20:47:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:08,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:08,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:47:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:08,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:08,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:47:08,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:08,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136673955] [2024-10-11 20:47:08,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033041222] [2024-10-11 20:47:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033041222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:08,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:08,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622988097] [2024-10-11 20:47:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:08,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:08,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:08,315 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:47:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:08,420 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2024-10-11 20:47:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:08,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 20:47:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:08,424 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:47:08,424 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:47:08,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:08,425 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:08,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:47:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:47:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:08,434 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 18 [2024-10-11 20:47:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:47:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:47:08,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:08,436 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:08,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:47:08,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:08,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:08,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1891501742, now seen corresponding path program 1 times [2024-10-11 20:47:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376520240] [2024-10-11 20:47:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003248734] [2024-10-11 20:47:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:08,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:08,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:47:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:08,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:08,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:08,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376520240] [2024-10-11 20:47:08,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003248734] [2024-10-11 20:47:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003248734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:08,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:47:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89013304] [2024-10-11 20:47:08,951 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:08,953 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:09,049 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:09,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-11 20:47:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:09,050 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:09,050 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:47:09,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:09,051 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:09,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 287 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:47:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 20:47:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 103 states have internal predecessors, (105), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-10-11 20:47:09,065 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 35 [2024-10-11 20:47:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:09,065 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-10-11 20:47:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:47:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-10-11 20:47:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 20:47:09,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:09,069 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-10-11 20:47:09,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:09,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:09,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1492988077, now seen corresponding path program 1 times [2024-10-11 20:47:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029079995] [2024-10-11 20:47:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029079995] [2024-10-11 20:47:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029079995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123041165] [2024-10-11 20:47:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:09,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:09,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:09,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:47:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:09,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:47:09,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:09,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123041165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:47:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89429701] [2024-10-11 20:47:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:47:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:47:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:09,678 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:09,792 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-10-11 20:47:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:47:09,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-11 20:47:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:09,794 INFO L225 Difference]: With dead ends: 111 [2024-10-11 20:47:09,794 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 20:47:09,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:47:09,795 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:09,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 366 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 20:47:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 20:47:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2024-10-11 20:47:09,802 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 36 [2024-10-11 20:47:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:09,802 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2024-10-11 20:47:09,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2024-10-11 20:47:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:47:09,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:09,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 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-10-11 20:47:09,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:47:10,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:10,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:10,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -242462763, now seen corresponding path program 1 times [2024-10-11 20:47:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460891828] [2024-10-11 20:47:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460891828] [2024-10-11 20:47:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460891828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673152990] [2024-10-11 20:47:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:10,068 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:10,107 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2024-10-11 20:47:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2024-10-11 20:47:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:10,108 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:47:10,109 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:47:10,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:10,110 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:10,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:47:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:47:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 20:47:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2024-10-11 20:47:10,117 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 38 [2024-10-11 20:47:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:10,118 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2024-10-11 20:47:10,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2024-10-11 20:47:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:47:10,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:10,120 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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-10-11 20:47:10,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:47:10,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:10,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1073589017, now seen corresponding path program 1 times [2024-10-11 20:47:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215056720] [2024-10-11 20:47:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215056720] [2024-10-11 20:47:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215056720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286309053] [2024-10-11 20:47:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:10,186 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:10,259 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2024-10-11 20:47:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 20:47:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:10,261 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:47:10,261 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 20:47:10,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:10,262 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:10,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 208 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 20:47:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 20:47:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2024-10-11 20:47:10,270 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 39 [2024-10-11 20:47:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:10,270 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2024-10-11 20:47:10,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2024-10-11 20:47:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:47:10,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:10,272 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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-10-11 20:47:10,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:47:10,272 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1078478761, now seen corresponding path program 1 times [2024-10-11 20:47:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52429815] [2024-10-11 20:47:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472809621] [2024-10-11 20:47:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:10,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:10,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:47:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:47:10,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:10,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:10,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52429815] [2024-10-11 20:47:10,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472809621] [2024-10-11 20:47:10,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472809621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:10,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:10,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722513297] [2024-10-11 20:47:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:10,362 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:10,422 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2024-10-11 20:47:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 20:47:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:10,424 INFO L225 Difference]: With dead ends: 149 [2024-10-11 20:47:10,424 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:10,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-10-11 20:47:10,425 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:10,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 114. [2024-10-11 20:47:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 106 states have internal predecessors, (108), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:47:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2024-10-11 20:47:10,432 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 40 [2024-10-11 20:47:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:10,433 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2024-10-11 20:47:10,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2024-10-11 20:47:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:47:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:10,434 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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-10-11 20:47:10,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:47:10,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:47:10,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 926896859, now seen corresponding path program 1 times [2024-10-11 20:47:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930627208] [2024-10-11 20:47:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:47:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930627208] [2024-10-11 20:47:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930627208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718770020] [2024-10-11 20:47:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:10,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:10,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:10,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:47:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:10,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:47:10,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:11,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718770020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:11,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-11 20:47:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961701630] [2024-10-11 20:47:11,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:47:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:47:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:47:11,388 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:11,704 INFO L93 Difference]: Finished difference Result 234 states and 245 transitions. [2024-10-11 20:47:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:47:11,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2024-10-11 20:47:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:11,707 INFO L225 Difference]: With dead ends: 234 [2024-10-11 20:47:11,707 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 20:47:11,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:47:11,709 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 281 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:11,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 578 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:47:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 20:47:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2024-10-11 20:47:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 123 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-10-11 20:47:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2024-10-11 20:47:11,740 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 41 [2024-10-11 20:47:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:11,740 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2024-10-11 20:47:11,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2024-10-11 20:47:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:47:11,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:11,742 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:47:11,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:47:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:47:11,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:11,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1689653917, now seen corresponding path program 1 times [2024-10-11 20:47:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255514155] [2024-10-11 20:47:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:11,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747688342] [2024-10-11 20:47:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:11,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:11,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:11,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:47:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:12,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 20:47:12,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:12,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:47:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255514155] [2024-10-11 20:47:12,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747688342] [2024-10-11 20:47:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747688342] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:12,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-10-11 20:47:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540943382] [2024-10-11 20:47:12,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:47:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:12,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:47:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:47:12,518 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:13,052 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2024-10-11 20:47:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:47:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2024-10-11 20:47:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:13,054 INFO L225 Difference]: With dead ends: 174 [2024-10-11 20:47:13,054 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 20:47:13,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:47:13,055 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 287 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:13,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 241 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 20:47:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-10-11 20:47:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 114 states have (on average 1.4035087719298245) internal successors, (160), 140 states have internal predecessors, (160), 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-10-11 20:47:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2024-10-11 20:47:13,066 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 43 [2024-10-11 20:47:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2024-10-11 20:47:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 20:47:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2024-10-11 20:47:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:47:13,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:13,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:47:13,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:47:13,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:47:13,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 259779167, now seen corresponding path program 1 times [2024-10-11 20:47:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705021979] [2024-10-11 20:47:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238945654] [2024-10-11 20:47:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:13,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:13,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:13,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:47:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:47:13,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:13,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:47:13,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705021979] [2024-10-11 20:47:13,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238945654] [2024-10-11 20:47:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238945654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:13,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:47:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802507688] [2024-10-11 20:47:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:13,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:47:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:13,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:47:13,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:47:13,355 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:13,456 INFO L93 Difference]: Finished difference Result 223 states and 258 transitions. [2024-10-11 20:47:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:47:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-10-11 20:47:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:13,458 INFO L225 Difference]: With dead ends: 223 [2024-10-11 20:47:13,458 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 20:47:13,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-10-11 20:47:13,458 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:13,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 131 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 20:47:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2024-10-11 20:47:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 176 states have internal predecessors, (202), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 216 transitions. [2024-10-11 20:47:13,468 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 216 transitions. Word has length 45 [2024-10-11 20:47:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 216 transitions. [2024-10-11 20:47:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:47:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 216 transitions. [2024-10-11 20:47:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 20:47:13,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:13,472 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:47:13,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:47:13,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:13,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1625504061, now seen corresponding path program 1 times [2024-10-11 20:47:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086677981] [2024-10-11 20:47:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:13,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:13,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086677981] [2024-10-11 20:47:13,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086677981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:13,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:13,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247814688] [2024-10-11 20:47:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:13,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:13,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:13,794 INFO L87 Difference]: Start difference. First operand 186 states and 216 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:13,937 INFO L93 Difference]: Finished difference Result 186 states and 216 transitions. [2024-10-11 20:47:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-10-11 20:47:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:13,939 INFO L225 Difference]: With dead ends: 186 [2024-10-11 20:47:13,939 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 20:47:13,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:47:13,940 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 101 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:13,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 173 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 20:47:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-11 20:47:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 175 states have internal predecessors, (199), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2024-10-11 20:47:13,949 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 63 [2024-10-11 20:47:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:13,950 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2024-10-11 20:47:13,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2024-10-11 20:47:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 20:47:13,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:13,951 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:47:13,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:47:13,952 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1148981528, now seen corresponding path program 1 times [2024-10-11 20:47:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:13,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547410935] [2024-10-11 20:47:13,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:13,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547410935] [2024-10-11 20:47:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547410935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654251644] [2024-10-11 20:47:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:14,006 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:14,122 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2024-10-11 20:47:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2024-10-11 20:47:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:14,124 INFO L225 Difference]: With dead ends: 189 [2024-10-11 20:47:14,124 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 20:47:14,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:14,125 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:14,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 20:47:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-10-11 20:47:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 174 states have internal predecessors, (196), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2024-10-11 20:47:14,134 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 64 [2024-10-11 20:47:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:14,135 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2024-10-11 20:47:14,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2024-10-11 20:47:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:47:14,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:14,135 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:47:14,135 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1759618188, now seen corresponding path program 1 times [2024-10-11 20:47:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975510370] [2024-10-11 20:47:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:14,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975510370] [2024-10-11 20:47:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975510370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:47:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228574165] [2024-10-11 20:47:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:14,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:47:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:47:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:47:14,248 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:14,357 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2024-10-11 20:47:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:47:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-10-11 20:47:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:14,359 INFO L225 Difference]: With dead ends: 185 [2024-10-11 20:47:14,359 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 20:47:14,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:47:14,360 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:14,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 221 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 20:47:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-11 20:47:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 174 states have internal predecessors, (193), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2024-10-11 20:47:14,371 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 68 [2024-10-11 20:47:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2024-10-11 20:47:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2024-10-11 20:47:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:47:14,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:14,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:47:14,373 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1286410942, now seen corresponding path program 1 times [2024-10-11 20:47:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503556259] [2024-10-11 20:47:14,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503556259] [2024-10-11 20:47:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503556259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920620672] [2024-10-11 20:47:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:14,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:14,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:14,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:14,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:47:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:14,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:14,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:14,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:47:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920620672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:14,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:14,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-10-11 20:47:14,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090563990] [2024-10-11 20:47:14,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:47:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:47:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:47:14,833 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:15,210 INFO L93 Difference]: Finished difference Result 211 states and 237 transitions. [2024-10-11 20:47:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:47:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 69 [2024-10-11 20:47:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:15,212 INFO L225 Difference]: With dead ends: 211 [2024-10-11 20:47:15,212 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 20:47:15,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:47:15,213 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 224 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:15,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 213 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 20:47:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2024-10-11 20:47:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 174 states have internal predecessors, (187), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 201 transitions. [2024-10-11 20:47:15,223 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 201 transitions. Word has length 69 [2024-10-11 20:47:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 201 transitions. [2024-10-11 20:47:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 15 states have internal predecessors, (137), 7 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 20:47:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 201 transitions. [2024-10-11 20:47:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 20:47:15,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:15,225 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:15,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:47:15,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:47:15,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1224033458, now seen corresponding path program 1 times [2024-10-11 20:47:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503110911] [2024-10-11 20:47:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503110911] [2024-10-11 20:47:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503110911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922181969] [2024-10-11 20:47:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:15,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:15,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:15,582 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:15,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:47:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:15,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:47:15,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:15,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:15,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922181969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:15,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:15,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 20:47:15,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048942822] [2024-10-11 20:47:15,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:15,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:47:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:15,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:47:15,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:47:15,908 INFO L87 Difference]: Start difference. First operand 184 states and 201 transitions. Second operand has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:47:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:16,246 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2024-10-11 20:47:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:47:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 70 [2024-10-11 20:47:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:16,248 INFO L225 Difference]: With dead ends: 212 [2024-10-11 20:47:16,248 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 20:47:16,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:47:16,249 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 165 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:16,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 236 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 20:47:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2024-10-11 20:47:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 174 states have internal predecessors, (184), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2024-10-11 20:47:16,259 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 70 [2024-10-11 20:47:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2024-10-11 20:47:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.23076923076923) internal successors, (120), 14 states have internal predecessors, (120), 6 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-11 20:47:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2024-10-11 20:47:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:47:16,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:16,260 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:16,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:16,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:47:16,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 329928270, now seen corresponding path program 1 times [2024-10-11 20:47:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106252466] [2024-10-11 20:47:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106252466] [2024-10-11 20:47:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106252466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051855918] [2024-10-11 20:47:16,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:16,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:16,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:47:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:16,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:47:16,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:47:16,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051855918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:29,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:47:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-11 20:47:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173245408] [2024-10-11 20:47:29,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:47:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:47:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=118, Unknown=2, NotChecked=0, Total=156 [2024-10-11 20:47:29,216 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:47:30,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:47:30,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:30,578 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2024-10-11 20:47:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:47:30,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2024-10-11 20:47:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:30,580 INFO L225 Difference]: With dead ends: 184 [2024-10-11 20:47:30,580 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 20:47:30,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=54, Invalid=154, Unknown=2, NotChecked=0, Total=210 [2024-10-11 20:47:30,581 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 131 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:30,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 184 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:47:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 20:47:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-11 20:47:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 134 states have (on average 1.1940298507462686) internal successors, (160), 154 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2024-10-11 20:47:30,592 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 81 [2024-10-11 20:47:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:30,592 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2024-10-11 20:47:30,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:47:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2024-10-11 20:47:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:47:30,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:30,593 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:30,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:47:30,794 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 80662310, now seen corresponding path program 1 times [2024-10-11 20:47:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192875382] [2024-10-11 20:47:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:47:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 20:47:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192875382] [2024-10-11 20:47:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192875382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:47:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:47:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:47:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293471045] [2024-10-11 20:47:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:47:30,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:47:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:47:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:30,866 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:30,969 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2024-10-11 20:47:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:47:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 93 [2024-10-11 20:47:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:30,971 INFO L225 Difference]: With dead ends: 166 [2024-10-11 20:47:30,971 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:47:30,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:47:30,972 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:30,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:47:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:47:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-10-11 20:47:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 154 states have internal predecessors, (159), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2024-10-11 20:47:30,980 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 93 [2024-10-11 20:47:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:30,980 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2024-10-11 20:47:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:47:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2024-10-11 20:47:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 20:47:30,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:30,981 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 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, 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-10-11 20:47:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:47:30,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:30,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1794435563, now seen corresponding path program 1 times [2024-10-11 20:47:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:30,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455687182] [2024-10-11 20:47:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:47:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 20:47:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455687182] [2024-10-11 20:47:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455687182] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925625958] [2024-10-11 20:47:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:31,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:31,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:31,081 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:31,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:47:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:31,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:47:31,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:47:31,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:47:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925625958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:31,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:31,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2024-10-11 20:47:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767820178] [2024-10-11 20:47:31,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:47:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:47:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:47:31,475 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand has 13 states, 12 states have (on average 16.083333333333332) internal successors, (193), 13 states have internal predecessors, (193), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-11 20:47:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:32,060 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2024-10-11 20:47:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:47:32,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 16.083333333333332) internal successors, (193), 13 states have internal predecessors, (193), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) Word has length 94 [2024-10-11 20:47:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:32,061 INFO L225 Difference]: With dead ends: 165 [2024-10-11 20:47:32,062 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 20:47:32,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:47:32,062 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 208 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:32,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 177 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:47:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 20:47:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-10-11 20:47:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.1492537313432836) internal successors, (154), 150 states have internal predecessors, (154), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2024-10-11 20:47:32,071 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 94 [2024-10-11 20:47:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:32,072 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2024-10-11 20:47:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 16.083333333333332) internal successors, (193), 13 states have internal predecessors, (193), 10 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 10 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-11 20:47:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2024-10-11 20:47:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 20:47:32,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:32,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 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, 1, 1, 1, 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-10-11 20:47:32,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:47:32,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:32,273 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:32,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1324530681, now seen corresponding path program 1 times [2024-10-11 20:47:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142173909] [2024-10-11 20:47:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:47:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 20:47:32,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142173909] [2024-10-11 20:47:32,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142173909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388618753] [2024-10-11 20:47:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:32,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:32,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:32,417 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:32,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:47:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:32,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:47:32,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 20:47:32,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 20:47:32,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388618753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:32,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:32,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-10-11 20:47:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345414153] [2024-10-11 20:47:32,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:32,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:47:32,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:32,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:47:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:47:32,839 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 14 states, 13 states have (on average 10.692307692307692) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:33,223 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2024-10-11 20:47:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:47:33,224 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.692307692307692) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 98 [2024-10-11 20:47:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:33,225 INFO L225 Difference]: With dead ends: 193 [2024-10-11 20:47:33,225 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 20:47:33,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:47:33,226 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 446 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:33,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 204 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 20:47:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 163. [2024-10-11 20:47:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.144927536231884) internal successors, (158), 153 states have internal predecessors, (158), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2024-10-11 20:47:33,236 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 98 [2024-10-11 20:47:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:33,236 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2024-10-11 20:47:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.692307692307692) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 20:47:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2024-10-11 20:47:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 20:47:33,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:33,238 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 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-10-11 20:47:33,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 20:47:33,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:33,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:33,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1889221771, now seen corresponding path program 1 times [2024-10-11 20:47:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095296727] [2024-10-11 20:47:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:47:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:47:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:47:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:47:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:47:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:47:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 20:47:33,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095296727] [2024-10-11 20:47:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095296727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957219681] [2024-10-11 20:47:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:33,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:33,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:33,582 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:33,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:47:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:33,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:47:33,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:47:33,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 20:47:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957219681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:47:34,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:47:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2024-10-11 20:47:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548001757] [2024-10-11 20:47:34,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:34,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:47:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:47:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:47:34,182 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand has 18 states, 17 states have (on average 12.294117647058824) internal successors, (209), 18 states have internal predecessors, (209), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 20:47:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:34,840 INFO L93 Difference]: Finished difference Result 186 states and 198 transitions. [2024-10-11 20:47:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:47:34,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 12.294117647058824) internal successors, (209), 18 states have internal predecessors, (209), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 99 [2024-10-11 20:47:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:34,844 INFO L225 Difference]: With dead ends: 186 [2024-10-11 20:47:34,844 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 20:47:34,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:47:34,845 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 272 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:34,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 167 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:47:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 20:47:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2024-10-11 20:47:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 151 states have internal predecessors, (155), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2024-10-11 20:47:34,853 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 99 [2024-10-11 20:47:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:34,854 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2024-10-11 20:47:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 12.294117647058824) internal successors, (209), 18 states have internal predecessors, (209), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 20:47:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2024-10-11 20:47:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 20:47:34,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:34,855 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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-10-11 20:47:34,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 20:47:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:35,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2112384977, now seen corresponding path program 1 times [2024-10-11 20:47:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713466150] [2024-10-11 20:47:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015765891] [2024-10-11 20:47:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:35,103 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:35,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:47:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:35,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 20:47:35,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:47:35,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713466150] [2024-10-11 20:47:35,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015765891] [2024-10-11 20:47:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015765891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:35,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-11 20:47:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935037363] [2024-10-11 20:47:35,928 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:35,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:47:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:35,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:47:35,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:47:35,929 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 20:47:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:36,363 INFO L93 Difference]: Finished difference Result 254 states and 265 transitions. [2024-10-11 20:47:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:47:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 103 [2024-10-11 20:47:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:36,364 INFO L225 Difference]: With dead ends: 254 [2024-10-11 20:47:36,364 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 20:47:36,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:47:36,365 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:36,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 356 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:47:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 20:47:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 20:47:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 140 states have internal predecessors, (142), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:47:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2024-10-11 20:47:36,374 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 103 [2024-10-11 20:47:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:36,375 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2024-10-11 20:47:36,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 20:47:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2024-10-11 20:47:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 20:47:36,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:47:36,376 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-10-11 20:47:36,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 20:47:36,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 20:47:36,581 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2024-10-11 20:47:36,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:47:36,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1913762373, now seen corresponding path program 1 times [2024-10-11 20:47:36,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:47:36,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784600393] [2024-10-11 20:47:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:47:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:47:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959527068] [2024-10-11 20:47:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:47:36,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:47:36,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:47:36,599 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:47:36,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 20:47:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:47:36,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:47:36,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:47:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:47:37,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:47:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:47:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784600393] [2024-10-11 20:47:43,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:47:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959527068] [2024-10-11 20:47:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959527068] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:47:43,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:47:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-11 20:47:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058714376] [2024-10-11 20:47:43,044 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:47:43,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:47:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:47:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:47:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:47:43,045 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:47:52,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 20:47:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:47:57,696 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2024-10-11 20:47:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:47:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 105 [2024-10-11 20:47:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:47:57,697 INFO L225 Difference]: With dead ends: 154 [2024-10-11 20:47:57,697 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:47:57,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:47:57,698 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:47:57,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 243 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 20:47:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:47:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:47:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:47:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:47:57,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2024-10-11 20:47:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:47:57,699 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:47:57,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:47:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:47:57,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:47:57,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 56 remaining) [2024-10-11 20:47:57,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 56 remaining) [2024-10-11 20:47:57,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 56 remaining) [2024-10-11 20:47:57,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 56 remaining) [2024-10-11 20:47:57,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 56 remaining) [2024-10-11 20:47:57,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 56 remaining) [2024-10-11 20:47:57,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 56 remaining) [2024-10-11 20:47:57,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 56 remaining) [2024-10-11 20:47:57,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 56 remaining) [2024-10-11 20:47:57,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 56 remaining) [2024-10-11 20:47:57,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 20:47:57,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 20:47:57,915 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:47:57,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:48:00,034 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:48:00,053 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:48:00,055 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:48:00,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:48:00,061 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:48:00,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:48:00 BoogieIcfgContainer [2024-10-11 20:48:00,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:48:00,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:48:00,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:48:00,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:48:00,069 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:47:07" (3/4) ... [2024-10-11 20:48:00,071 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:48:00,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 20:48:00,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:48:00,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 20:48:00,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:48:00,082 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:48:00,083 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:48:00,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:48:00,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:48:00,180 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:48:00,180 INFO L158 Benchmark]: Toolchain (without parser) took 53790.23ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 129.0MB in the beginning and 162.2MB in the end (delta: -33.1MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.43ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 116.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.24ms. Allocated memory is still 197.1MB. Free memory was 116.6MB in the beginning and 170.1MB in the end (delta: -53.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: Boogie Preprocessor took 86.26ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 168.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: RCFGBuilder took 527.67ms. Allocated memory is still 197.1MB. Free memory was 168.3MB in the beginning and 145.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,181 INFO L158 Benchmark]: TraceAbstraction took 52712.36ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 144.4MB in the beginning and 168.4MB in the end (delta: -24.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,182 INFO L158 Benchmark]: Witness Printer took 112.61ms. Allocated memory is still 266.3MB. Free memory was 168.4MB in the beginning and 162.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:48:00,183 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 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.43ms. Allocated memory is still 197.1MB. Free memory was 128.9MB in the beginning and 116.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.24ms. Allocated memory is still 197.1MB. Free memory was 116.6MB in the beginning and 170.1MB in the end (delta: -53.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.26ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 168.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.67ms. Allocated memory is still 197.1MB. Free memory was 168.3MB in the beginning and 145.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 52712.36ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 144.4MB in the beginning and 168.4MB in the end (delta: -24.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * Witness Printer took 112.61ms. Allocated memory is still 266.3MB. Free memory was 168.4MB in the beginning and 162.2MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: 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: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: 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, 133 locations, 56 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2681 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2661 mSDsluCounter, 5539 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3856 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5647 IncrementalHoareTripleChecker+Invalid, 5860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 1683 mSDtfsCounter, 5647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1920 GetRequests, 1692 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 28.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=12, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 177 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 2359 NumberOfCodeBlocks, 2359 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2405 ConstructedInterpolants, 81 QuantifiedInterpolants, 11849 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1734 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 38 InterpolantComputations, 13 PerfectInterpolantSequences, 960/1263 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 56 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (v == 1)) && (A <= 1)) && (((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) + 1) <= (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) || ((((((((__int128) u * u) <= 9223372036854775807) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (A <= 1)) && (3 <= u)) && (0 <= A))) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:48:00,403 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 20:48:00,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE