./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:39:27,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:39:27,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:39:27,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:39:27,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:39:27,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:39:27,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:39:27,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:39:27,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:39:27,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:39:27,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:39:27,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:39:27,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:39:27,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:39:27,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:39:27,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:39:27,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:39:27,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:39:27,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:39:27,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:39:27,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:39:27,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:39:27,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:39:27,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:39:27,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:39:27,567 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:39:27,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:39:27,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:39:27,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:39:27,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:39:27,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:39:27,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:39:27,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:39:27,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:39:27,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:27,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:39:27,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:39:27,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:39:27,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:39:27,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:39:27,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:39:27,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:39:27,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:39:27,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:39:27,574 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 [2024-11-10 19:39:27,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:39:27,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:39:27,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:39:27,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:39:27,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:39:27,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-11-10 19:39:29,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:39:29,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:39:29,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-11-10 19:39:29,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8203840f5/6f11b187bfe64ab0bf272296900de6ff/FLAGfac0e3db9 [2024-11-10 19:39:29,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8203840f5/6f11b187bfe64ab0bf272296900de6ff [2024-11-10 19:39:29,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:39:29,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:39:29,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:29,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:39:29,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:39:29,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f5daca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29, skipping insertion in model container [2024-11-10 19:39:29,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:39:29,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:29,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:39:29,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:29,862 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:39:29,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29 WrapperNode [2024-11-10 19:39:29,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:29,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:29,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:39:29,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:39:29,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,882 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2024-11-10 19:39:29,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:29,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:39:29,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:39:29,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:39:29,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 19:39:29,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:39:29,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:39:29,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:39:29,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:39:29,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (1/1) ... [2024-11-10 19:39:29,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:29,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:39:29,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:39:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:39:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:39:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:39:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:39:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-10 19:39:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-10 19:39:30,013 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:39:30,015 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:39:30,080 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2024-11-10 19:39:30,085 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-10 19:39:30,086 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:39:30,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:39:30,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:39:30,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:30 BoogieIcfgContainer [2024-11-10 19:39:30,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:39:30,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:39:30,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:39:30,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:39:30,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:39:29" (1/3) ... [2024-11-10 19:39:30,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a11ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:30, skipping insertion in model container [2024-11-10 19:39:30,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:29" (2/3) ... [2024-11-10 19:39:30,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a11ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:30, skipping insertion in model container [2024-11-10 19:39:30,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:30" (3/3) ... [2024-11-10 19:39:30,103 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2024-11-10 19:39:30,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:39:30,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 19:39:30,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:39:30,169 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;@2d83736e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:39:30,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 19:39:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 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-11-10 19:39:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:39:30,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:30,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:39:30,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1123799900, now seen corresponding path program 1 times [2024-11-10 19:39:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145065447] [2024-11-10 19:39:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145065447] [2024-11-10 19:39:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145065447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:30,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008551317] [2024-11-10 19:39:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:30,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:30,417 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 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) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:30,472 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-10 19:39:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:30,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 19:39:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:30,479 INFO L225 Difference]: With dead ends: 48 [2024-11-10 19:39:30,479 INFO L226 Difference]: Without dead ends: 29 [2024-11-10 19:39:30,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:39:30,483 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 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-11-10 19:39:30,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-10 19:39:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-10 19:39:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:39:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-10 19:39:30,509 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2024-11-10 19:39:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:30,509 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-10 19:39:30,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-10 19:39:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 19:39:30,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:30,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:30,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:39:30,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:30,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 478058520, now seen corresponding path program 1 times [2024-11-10 19:39:30,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:30,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121633787] [2024-11-10 19:39:30,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121633787] [2024-11-10 19:39:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121633787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:30,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696932700] [2024-11-10 19:39:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:30,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:30,585 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:30,646 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-10 19:39:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:30,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 19:39:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:30,648 INFO L225 Difference]: With dead ends: 28 [2024-11-10 19:39:30,648 INFO L226 Difference]: Without dead ends: 27 [2024-11-10 19:39:30,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:39:30,649 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:30,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-10 19:39:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-10 19:39:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:39:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-10 19:39:30,664 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2024-11-10 19:39:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-10 19:39:30,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-10 19:39:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 19:39:30,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:30,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:30,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:39:30,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 214158321, now seen corresponding path program 1 times [2024-11-10 19:39:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830058110] [2024-11-10 19:39:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:30,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830058110] [2024-11-10 19:39:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830058110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572721143] [2024-11-10 19:39:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:30,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:30,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:30,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:30,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:39:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:30,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:39:30,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:30,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572721143] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:30,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 19:39:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18764203] [2024-11-10 19:39:30,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 19:39:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 19:39:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:39:30,938 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:31,036 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-10 19:39:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:39:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 19:39:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:31,037 INFO L225 Difference]: With dead ends: 80 [2024-11-10 19:39:31,037 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 19:39:31,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-10 19:39:31,039 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:31,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 122 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 19:39:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-11-10 19:39:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 19:39:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-11-10 19:39:31,047 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 11 [2024-11-10 19:39:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:31,048 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-11-10 19:39:31,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-10 19:39:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 19:39:31,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:31,049 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:31,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:39:31,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:31,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:31,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash 522886875, now seen corresponding path program 1 times [2024-11-10 19:39:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666095176] [2024-11-10 19:39:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 19:39:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 19:39:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666095176] [2024-11-10 19:39:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666095176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:31,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:39:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385012262] [2024-11-10 19:39:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:39:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:39:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:39:31,342 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:39:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:31,374 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2024-11-10 19:39:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:39:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-10 19:39:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:31,379 INFO L225 Difference]: With dead ends: 82 [2024-11-10 19:39:31,379 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 19:39:31,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:39:31,381 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:31,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 19:39:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-10 19:39:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 61 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-10 19:39:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-11-10 19:39:31,394 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 19 [2024-11-10 19:39:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:31,394 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-10 19:39:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:39:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2024-11-10 19:39:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 19:39:31,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:31,395 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-10 19:39:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:39:31,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1391859100, now seen corresponding path program 2 times [2024-11-10 19:39:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303487113] [2024-11-10 19:39:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303487113] [2024-11-10 19:39:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303487113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:31,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045899267] [2024-11-10 19:39:31,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:31,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:31,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:31,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:31,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:39:31,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:31,589 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:31,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 19:39:31,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:31,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045899267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:31,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-10 19:39:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103002727] [2024-11-10 19:39:31,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 19:39:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 19:39:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-11-10 19:39:31,808 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:32,083 INFO L93 Difference]: Finished difference Result 213 states and 231 transitions. [2024-11-10 19:39:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:39:32,084 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-10 19:39:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:32,085 INFO L225 Difference]: With dead ends: 213 [2024-11-10 19:39:32,085 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 19:39:32,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:39:32,087 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 289 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:32,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 312 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 19:39:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2024-11-10 19:39:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.2222222222222223) internal successors, (154), 127 states have internal predecessors, (154), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-10 19:39:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2024-11-10 19:39:32,101 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 26 [2024-11-10 19:39:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:32,101 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2024-11-10 19:39:32,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2024-11-10 19:39:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 19:39:32,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:32,103 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:32,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:39:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:32,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -285602841, now seen corresponding path program 1 times [2024-11-10 19:39:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583859592] [2024-11-10 19:39:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 19:39:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-10 19:39:32,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:32,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583859592] [2024-11-10 19:39:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583859592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:32,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:39:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185564028] [2024-11-10 19:39:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:32,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:39:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:39:32,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:39:32,353 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:39:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:32,370 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2024-11-10 19:39:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:39:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-10 19:39:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:32,371 INFO L225 Difference]: With dead ends: 157 [2024-11-10 19:39:32,374 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 19:39:32,375 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-11-10 19:39:32,375 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:32,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 19:39:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-10 19:39:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.1349206349206349) internal successors, (143), 126 states have internal predecessors, (143), 12 states have call successors, (12), 11 states have call predecessors, (12), 16 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-10 19:39:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2024-11-10 19:39:32,390 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 40 [2024-11-10 19:39:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:32,390 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2024-11-10 19:39:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:39:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2024-11-10 19:39:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:39:32,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:32,391 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:32,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:39:32,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -263753497, now seen corresponding path program 1 times [2024-11-10 19:39:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6294908] [2024-11-10 19:39:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 19:39:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-10 19:39:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:32,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6294908] [2024-11-10 19:39:32,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6294908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:32,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082458247] [2024-11-10 19:39:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:32,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:32,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:32,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:39:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:32,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:39:32,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:39:32,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:39:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082458247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:32,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-10 19:39:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69246207] [2024-11-10 19:39:32,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:32,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 19:39:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 19:39:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:39:32,647 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:39:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:32,745 INFO L93 Difference]: Finished difference Result 310 states and 356 transitions. [2024-11-10 19:39:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:39:32,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-11-10 19:39:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:32,747 INFO L225 Difference]: With dead ends: 310 [2024-11-10 19:39:32,747 INFO L226 Difference]: Without dead ends: 309 [2024-11-10 19:39:32,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-10 19:39:32,748 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:32,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-10 19:39:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-10 19:39:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 255 states have (on average 1.0666666666666667) internal successors, (272), 252 states have internal predecessors, (272), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2024-11-10 19:39:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 329 transitions. [2024-11-10 19:39:32,768 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 329 transitions. Word has length 41 [2024-11-10 19:39:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:32,768 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 329 transitions. [2024-11-10 19:39:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:39:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 329 transitions. [2024-11-10 19:39:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 19:39:32,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:32,770 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-11-10 19:39:32,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:39:32,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:32,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 578956540, now seen corresponding path program 3 times [2024-11-10 19:39:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113561494] [2024-11-10 19:39:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:33,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113561494] [2024-11-10 19:39:33,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113561494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40865154] [2024-11-10 19:39:33,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:39:33,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:33,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:33,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:33,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:39:33,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 19:39:33,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:33,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 19:39:33,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:33,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40865154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:33,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-10 19:39:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456694324] [2024-11-10 19:39:33,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:33,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 19:39:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 19:39:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 19:39:33,987 INFO L87 Difference]: Start difference. First operand 309 states and 329 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:34,132 INFO L93 Difference]: Finished difference Result 314 states and 329 transitions. [2024-11-10 19:39:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:39:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 19:39:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:34,135 INFO L225 Difference]: With dead ends: 314 [2024-11-10 19:39:34,135 INFO L226 Difference]: Without dead ends: 313 [2024-11-10 19:39:34,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 19:39:34,137 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 236 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:34,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 173 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-10 19:39:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 308. [2024-11-10 19:39:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 255 states have (on average 1.0627450980392157) internal successors, (271), 251 states have internal predecessors, (271), 12 states have call successors, (12), 11 states have call predecessors, (12), 40 states have return successors, (45), 45 states have call predecessors, (45), 11 states have call successors, (45) [2024-11-10 19:39:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2024-11-10 19:39:34,162 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 56 [2024-11-10 19:39:34,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:34,163 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2024-11-10 19:39:34,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2024-11-10 19:39:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 19:39:34,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:34,170 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 19:39:34,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:39:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:34,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1906005668, now seen corresponding path program 2 times [2024-11-10 19:39:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142274048] [2024-11-10 19:39:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:39:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 5 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-10 19:39:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142274048] [2024-11-10 19:39:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142274048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225828526] [2024-11-10 19:39:34,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:34,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:34,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:39:34,654 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:34,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:34,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 19:39:34,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:39:34,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 19:39:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225828526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:35,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-10 19:39:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635526814] [2024-11-10 19:39:35,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 19:39:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 19:39:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-10 19:39:35,183 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 19:39:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:35,382 INFO L93 Difference]: Finished difference Result 687 states and 772 transitions. [2024-11-10 19:39:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 19:39:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 59 [2024-11-10 19:39:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:35,384 INFO L225 Difference]: With dead ends: 687 [2024-11-10 19:39:35,384 INFO L226 Difference]: Without dead ends: 424 [2024-11-10 19:39:35,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 19:39:35,386 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:35,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 50 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-10 19:39:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-11-10 19:39:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 355 states have (on average 1.0309859154929577) internal successors, (366), 346 states have internal predecessors, (366), 12 states have call successors, (12), 11 states have call predecessors, (12), 56 states have return successors, (66), 66 states have call predecessors, (66), 11 states have call successors, (66) [2024-11-10 19:39:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 444 transitions. [2024-11-10 19:39:35,413 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 444 transitions. Word has length 59 [2024-11-10 19:39:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:35,413 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 444 transitions. [2024-11-10 19:39:35,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-10 19:39:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 444 transitions. [2024-11-10 19:39:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 19:39:35,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:35,415 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2024-11-10 19:39:35,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:39:35,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:35,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1071827202, now seen corresponding path program 3 times [2024-11-10 19:39:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298864749] [2024-11-10 19:39:35,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:35,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:39:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:35,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 11 proven. 320 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-10 19:39:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298864749] [2024-11-10 19:39:36,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298864749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:36,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801712785] [2024-11-10 19:39:36,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:39:36,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:36,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:36,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:36,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:39:36,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 19:39:36,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:36,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 19:39:36,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-10 19:39:36,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-10 19:39:40,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801712785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:40,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:40,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2024-11-10 19:39:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673842333] [2024-11-10 19:39:40,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:40,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 19:39:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 19:39:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 19:39:40,418 INFO L87 Difference]: Start difference. First operand 424 states and 444 transitions. Second operand has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 19:39:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:40,986 INFO L93 Difference]: Finished difference Result 1181 states and 1332 transitions. [2024-11-10 19:39:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-10 19:39:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) Word has length 125 [2024-11-10 19:39:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:40,991 INFO L225 Difference]: With dead ends: 1181 [2024-11-10 19:39:40,994 INFO L226 Difference]: Without dead ends: 496 [2024-11-10 19:39:40,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2024-11-10 19:39:41,003 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 119 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:41,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 68 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-10 19:39:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-11-10 19:39:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 415 states have (on average 1.0265060240963855) internal successors, (426), 406 states have internal predecessors, (426), 12 states have call successors, (12), 11 states have call predecessors, (12), 68 states have return successors, (78), 78 states have call predecessors, (78), 11 states have call successors, (78) [2024-11-10 19:39:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 516 transitions. [2024-11-10 19:39:41,044 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 516 transitions. Word has length 125 [2024-11-10 19:39:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 516 transitions. [2024-11-10 19:39:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 23 states have return successors, (23), 23 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 19:39:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 516 transitions. [2024-11-10 19:39:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-10 19:39:41,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:41,047 INFO L215 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1] [2024-11-10 19:39:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:39:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:41,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-10 19:39:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2113114290, now seen corresponding path program 4 times [2024-11-10 19:39:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943089109] [2024-11-10 19:39:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:39:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:42,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:42,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:39:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 23 proven. 1496 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2024-11-10 19:39:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943089109] [2024-11-10 19:39:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943089109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607733771] [2024-11-10 19:39:44,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 19:39:44,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:44,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:39:44,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:39:45,069 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 19:39:45,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:45,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 19:39:45,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1496 proven. 112 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2024-11-10 19:39:45,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:40:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1496 proven. 1058 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-10 19:40:34,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607733771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:40:34,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:40:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 29, 51] total 102 [2024-11-10 19:40:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725434618] [2024-11-10 19:40:34,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:40:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-10 19:40:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-10 19:40:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=8995, Unknown=0, NotChecked=0, Total=10302 [2024-11-10 19:40:34,640 INFO L87 Difference]: Start difference. First operand 496 states and 516 transitions. Second operand has 102 states, 100 states have (on average 3.41) internal successors, (341), 100 states have internal predecessors, (341), 28 states have call successors, (29), 3 states have call predecessors, (29), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) [2024-11-10 19:40:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:34,921 INFO L93 Difference]: Finished difference Result 496 states and 516 transitions. [2024-11-10 19:40:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:40:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 3.41) internal successors, (341), 100 states have internal predecessors, (341), 28 states have call successors, (29), 3 states have call predecessors, (29), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) Word has length 257 [2024-11-10 19:40:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:34,922 INFO L225 Difference]: With dead ends: 496 [2024-11-10 19:40:34,922 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:40:34,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 482 SyntacticMatches, 23 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6097 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1903, Invalid=10753, Unknown=0, NotChecked=0, Total=12656 [2024-11-10 19:40:34,926 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 226 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:34,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 190 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:40:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:40:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:40:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:40:34,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2024-11-10 19:40:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:34,927 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:40:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 3.41) internal successors, (341), 100 states have internal predecessors, (341), 28 states have call successors, (29), 3 states have call predecessors, (29), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) [2024-11-10 19:40:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:40:34,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:40:34,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-10 19:40:34,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-10 19:40:34,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-10 19:40:34,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-10 19:40:34,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:40:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:35,134 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2024-11-10 19:40:35,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:40:35,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:40:35,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:40:35 BoogieIcfgContainer [2024-11-10 19:40:35,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:40:35,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:40:35,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:40:35,739 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:40:35,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:30" (3/4) ... [2024-11-10 19:40:35,741 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:40:35,744 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2024-11-10 19:40:35,748 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-10 19:40:35,749 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 19:40:35,749 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:40:35,749 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:40:35,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:40:35,814 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:40:35,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:40:35,815 INFO L158 Benchmark]: Toolchain (without parser) took 66202.42ms. Allocated memory was 148.9MB in the beginning and 805.3MB in the end (delta: 656.4MB). Free memory was 76.8MB in the beginning and 562.8MB in the end (delta: -486.0MB). Peak memory consumption was 171.3MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,815 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 148.9MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:40:35,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.07ms. Allocated memory was 148.9MB in the beginning and 249.6MB in the end (delta: 100.7MB). Free memory was 76.6MB in the beginning and 218.1MB in the end (delta: -141.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.59ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 217.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,816 INFO L158 Benchmark]: Boogie Preprocessor took 17.71ms. Allocated memory is still 249.6MB. Free memory was 217.1MB in the beginning and 216.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,817 INFO L158 Benchmark]: IcfgBuilder took 196.14ms. Allocated memory is still 249.6MB. Free memory was 216.1MB in the beginning and 203.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,817 INFO L158 Benchmark]: TraceAbstraction took 65639.63ms. Allocated memory was 249.6MB in the beginning and 805.3MB in the end (delta: 555.7MB). Free memory was 203.5MB in the beginning and 568.1MB in the end (delta: -364.6MB). Peak memory consumption was 475.3MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,817 INFO L158 Benchmark]: Witness Printer took 76.15ms. Allocated memory is still 805.3MB. Free memory was 568.1MB in the beginning and 562.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:40:35,819 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 148.9MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.07ms. Allocated memory was 148.9MB in the beginning and 249.6MB in the end (delta: 100.7MB). Free memory was 76.6MB in the beginning and 218.1MB in the end (delta: -141.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.59ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 217.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.71ms. Allocated memory is still 249.6MB. Free memory was 217.1MB in the beginning and 216.1MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 196.14ms. Allocated memory is still 249.6MB. Free memory was 216.1MB in the beginning and 203.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 65639.63ms. Allocated memory was 249.6MB in the beginning and 805.3MB in the end (delta: 555.7MB). Free memory was 203.5MB in the beginning and 568.1MB in the end (delta: -364.6MB). Peak memory consumption was 475.3MB. Max. memory is 16.1GB. * Witness Printer took 76.15ms. Allocated memory is still 805.3MB. Free memory was 568.1MB in the beginning and 562.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 65.0s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1146 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1104 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 956 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1272 IncrementalHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 174 mSDtfsCounter, 1272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 1074 SyntacticMatches, 23 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11028 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=10, InterpolantAutomatonStates: 166, 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, 11 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 60.7s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1772 ConstructedInterpolants, 0 QuantifiedInterpolants, 4808 SizeOfPredicates, 41 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 7079/11788 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id. Requires: ((0 <= x) && (x <= 5)) Ensures: ((((((((\result <= 5) && (5 == x)) || ((3 <= x) && (\result <= 3))) || ((\result <= 2) && (2 <= x))) || ((\result <= 4) && (4 <= x))) || ((\result <= 1) && (1 <= x))) || ((\result == 0) && (x == 0))) && (x <= 5)) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:40:35,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE