./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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-1.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 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:49:42,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:49:42,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:49:42,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:49:42,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:49:42,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:49:42,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:49:42,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:49:42,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:49:42,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:49:42,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:49:42,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:49:42,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:49:42,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:49:42,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:49:42,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:49:42,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:49:42,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:49:42,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:49:42,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:49:42,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:49:42,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:49:42,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:49:42,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:49:42,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:49:42,270 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:49:42,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:49:42,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:49:42,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:49:42,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:49:42,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:49:42,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:49:42,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:49:42,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:49:42,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:49:42,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:49:42,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:49:42,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:49:42,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:49:42,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:49:42,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:49:42,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:49:42,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:49:42,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:49:42,276 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 -> 019a1f0c8a0db266ae045e6c9616b1be3853f9265d9110ea0f95df9172dad7ef [2024-11-12 17:49:42,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:49:42,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:49:42,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:49:42,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:49:42,537 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:49:42,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2024-11-12 17:49:43,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:49:44,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:49:44,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i5_o5-1.c [2024-11-12 17:49:44,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f121191/fa1e343552a143ef8d1edfc07aa644ce/FLAG445ee3918 [2024-11-12 17:49:44,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78f121191/fa1e343552a143ef8d1edfc07aa644ce [2024-11-12 17:49:44,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:49:44,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:49:44,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:49:44,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:49:44,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:49:44,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2986af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44, skipping insertion in model container [2024-11-12 17:49:44,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:49:44,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:49:44,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:49:44,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:49:44,751 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:49:44,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44 WrapperNode [2024-11-12 17:49:44,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:49:44,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:49:44,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:49:44,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:49:44,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,776 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2024-11-12 17:49:44,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:49:44,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:49:44,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:49:44,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:49:44,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,797 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-12 17:49:44,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:49:44,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:49:44,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:49:44,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:49:44,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (1/1) ... [2024-11-12 17:49:44,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:49:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:44,840 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-12 17:49:44,847 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-12 17:49:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:49:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:49:44,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:49:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:49:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-12 17:49:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-12 17:49:44,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:49:44,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:49:45,081 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-12 17:49:45,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:49:45,095 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:49:45,097 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 17:49:45,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:49:45 BoogieIcfgContainer [2024-11-12 17:49:45,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:49:45,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:49:45,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:49:45,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:49:45,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:49:44" (1/3) ... [2024-11-12 17:49:45,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0c2371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:49:45, skipping insertion in model container [2024-11-12 17:49:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:44" (2/3) ... [2024-11-12 17:49:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0c2371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:49:45, skipping insertion in model container [2024-11-12 17:49:45,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:49:45" (3/3) ... [2024-11-12 17:49:45,107 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5-1.c [2024-11-12 17:49:45,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:49:45,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 17:49:45,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:49:45,195 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;@7321b50a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:49:45,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 17:49:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 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-12 17:49:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 17:49:45,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:45,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 17:49:45,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 890350836, now seen corresponding path program 1 times [2024-11-12 17:49:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669774297] [2024-11-12 17:49:45,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:45,419 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-12 17:49:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669774297] [2024-11-12 17:49:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669774297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:49:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:49:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:49:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520891484] [2024-11-12 17:49:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:49:45,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:49:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:49:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:49:45,454 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 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-12 17:49:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:45,536 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-12 17:49:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:49:45,538 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-12 17:49:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:45,544 INFO L225 Difference]: With dead ends: 46 [2024-11-12 17:49:45,544 INFO L226 Difference]: Without dead ends: 28 [2024-11-12 17:49:45,547 INFO L434 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-12 17:49:45,550 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 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-12 17:49:45,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:49:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-12 17:49:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-12 17:49:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 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-12 17:49:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-12 17:49:45,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2024-11-12 17:49:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-12 17:49:45,588 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-12 17:49:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-12 17:49:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 17:49:45,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:45,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:49:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:49:45,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1831072195, now seen corresponding path program 1 times [2024-11-12 17:49:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448117743] [2024-11-12 17:49:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:45,688 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-12 17:49:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448117743] [2024-11-12 17:49:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448117743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:49:45,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:49:45,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:49:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098965791] [2024-11-12 17:49:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:49:45,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:49:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:49:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:49:45,696 INFO L87 Difference]: Start difference. First operand 25 states and 29 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-12 17:49:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:45,741 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-12 17:49:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:49:45,742 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-12 17:49:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:45,744 INFO L225 Difference]: With dead ends: 27 [2024-11-12 17:49:45,744 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 17:49:45,744 INFO L434 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-12 17:49:45,746 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 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-12 17:49:45,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:49:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 17:49:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-12 17:49:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 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-12 17:49:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-12 17:49:45,785 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2024-11-12 17:49:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:45,786 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-12 17:49:45,786 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-12 17:49:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-12 17:49:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 17:49:45,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:45,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:49:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:49:45,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1922931507, now seen corresponding path program 1 times [2024-11-12 17:49:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261059369] [2024-11-12 17:49:45,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:45,967 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-12 17:49:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:45,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261059369] [2024-11-12 17:49:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261059369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039202853] [2024-11-12 17:49:45,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:45,976 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-12 17:49:45,984 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-12 17:49:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:49:46,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:46,108 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-12 17:49:46,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:46,218 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-12 17:49:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039202853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:46,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 17:49:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977738404] [2024-11-12 17:49:46,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 17:49:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 17:49:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:49:46,225 INFO L87 Difference]: Start difference. First operand 24 states and 27 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-12 17:49:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:46,432 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-12 17:49:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 17:49:46,434 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-12 17:49:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:46,435 INFO L225 Difference]: With dead ends: 76 [2024-11-12 17:49:46,436 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 17:49:46,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-12 17:49:46,438 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:46,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:49:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 17:49:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2024-11-12 17:49:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 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-12 17:49:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-12 17:49:46,463 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 11 [2024-11-12 17:49:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:46,463 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-12 17:49:46,464 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-12 17:49:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-12 17:49:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 17:49:46,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:46,465 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:49:46,481 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-12 17:49:46,665 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-12 17:49:46,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1856245274, now seen corresponding path program 1 times [2024-11-12 17:49:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403697443] [2024-11-12 17:49:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-12 17:49:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,771 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-12 17:49:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403697443] [2024-11-12 17:49:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403697443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:49:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:49:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:49:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633914996] [2024-11-12 17:49:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:49:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:49:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:49:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:49:46,779 INFO L87 Difference]: Start difference. First operand 54 states and 65 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-12 17:49:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:46,804 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-11-12 17:49:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:49:46,806 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-12 17:49:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:46,809 INFO L225 Difference]: With dead ends: 74 [2024-11-12 17:49:46,809 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 17:49:46,810 INFO L434 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-12 17:49:46,811 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:46,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:49:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 17:49:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 17:49:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 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-12 17:49:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2024-11-12 17:49:46,834 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19 [2024-11-12 17:49:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:46,835 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2024-11-12 17:49:46,835 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-12 17:49:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2024-11-12 17:49:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 17:49:46,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:46,837 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:49:46,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:49:46,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -614066819, now seen corresponding path program 1 times [2024-11-12 17:49:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143697135] [2024-11-12 17:49:46,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 17:49:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 17:49:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143697135] [2024-11-12 17:49:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143697135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:49:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:49:46,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:49:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860982898] [2024-11-12 17:49:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:49:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:49:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:49:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:49:46,912 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-12 17:49:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:46,930 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-11-12 17:49:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:49:46,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 24 [2024-11-12 17:49:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:46,932 INFO L225 Difference]: With dead ends: 72 [2024-11-12 17:49:46,932 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 17:49:46,933 INFO L434 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-12 17:49:46,934 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:46,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:49:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 17:49:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 17:49:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 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-12 17:49:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2024-11-12 17:49:46,958 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 24 [2024-11-12 17:49:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:46,958 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2024-11-12 17:49:46,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-12 17:49:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-11-12 17:49:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 17:49:46,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:46,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-12 17:49:46,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:49:46,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:46,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1990585420, now seen corresponding path program 2 times [2024-11-12 17:49:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495507135] [2024-11-12 17:49:46,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:47,177 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-12 17:49:47,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:47,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495507135] [2024-11-12 17:49:47,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495507135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:47,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169130797] [2024-11-12 17:49:47,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:49:47,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:47,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:47,186 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-12 17:49:47,188 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-12 17:49:47,222 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:49:47,222 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:49:47,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 17:49:47,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:47,279 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-12 17:49:47,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:47,525 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-12 17:49:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169130797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:47,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-12 17:49:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238758115] [2024-11-12 17:49:47,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:47,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 17:49:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 17:49:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-11-12 17:49:47,529 INFO L87 Difference]: Start difference. First operand 71 states and 79 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-12 17:49:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:47,894 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2024-11-12 17:49:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 17:49:47,895 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-12 17:49:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:47,896 INFO L225 Difference]: With dead ends: 188 [2024-11-12 17:49:47,896 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 17:49:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 17:49:47,897 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 272 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:47,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 201 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:49:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 17:49:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2024-11-12 17:49:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 116 states have (on average 1.146551724137931) internal successors, (133), 116 states have internal predecessors, (133), 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-12 17:49:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2024-11-12 17:49:47,931 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 26 [2024-11-12 17:49:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:47,931 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2024-11-12 17:49:47,933 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-12 17:49:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2024-11-12 17:49:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 17:49:47,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:47,935 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:49:47,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:49:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 17:49:48,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:48,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1350016289, now seen corresponding path program 1 times [2024-11-12 17:49:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175673166] [2024-11-12 17:49:48,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 17:49:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:48,296 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-12 17:49:48,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175673166] [2024-11-12 17:49:48,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175673166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924343829] [2024-11-12 17:49:48,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:48,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:48,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:48,300 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-12 17:49:48,302 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-12 17:49:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:48,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:49:48,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:48,390 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-12 17:49:48,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:48,494 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-12 17:49:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924343829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:48,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-12 17:49:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235563533] [2024-11-12 17:49:48,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:48,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:49:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:49:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:49:48,499 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-12 17:49:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:48,638 INFO L93 Difference]: Finished difference Result 276 states and 322 transitions. [2024-11-12 17:49:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:49:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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 40 [2024-11-12 17:49:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:48,641 INFO L225 Difference]: With dead ends: 276 [2024-11-12 17:49:48,641 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 17:49:48,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 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-12 17:49:48,642 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:48,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:49:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 17:49:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-12 17:49:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 221 states have (on average 1.0769230769230769) internal successors, (238), 218 states have internal predecessors, (238), 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-12 17:49:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 295 transitions. [2024-11-12 17:49:48,687 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 295 transitions. Word has length 40 [2024-11-12 17:49:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 295 transitions. [2024-11-12 17:49:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 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-12 17:49:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 295 transitions. [2024-11-12 17:49:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 17:49:48,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:48,691 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-11-12 17:49:48,709 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-12 17:49:48,892 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-12 17:49:48,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash -91829804, now seen corresponding path program 3 times [2024-11-12 17:49:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898009322] [2024-11-12 17:49:48,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:49,337 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-12 17:49:49,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:49,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898009322] [2024-11-12 17:49:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898009322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017197328] [2024-11-12 17:49:49,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:49:49,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:49,344 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-12 17:49:49,346 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-12 17:49:49,397 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 17:49:49,397 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:49:49,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 17:49:49,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:49,511 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-12 17:49:49,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:50,131 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-12 17:49:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017197328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:50,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-12 17:49:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619216519] [2024-11-12 17:49:50,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 17:49:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 17:49:50,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 17:49:50,135 INFO L87 Difference]: Start difference. First operand 275 states and 295 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-12 17:49:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:50,299 INFO L93 Difference]: Finished difference Result 280 states and 295 transitions. [2024-11-12 17:49:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 17:49:50,300 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-12 17:49:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:50,302 INFO L225 Difference]: With dead ends: 280 [2024-11-12 17:49:50,302 INFO L226 Difference]: Without dead ends: 279 [2024-11-12 17:49:50,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2024-11-12 17:49:50,308 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 168 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:50,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 136 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:49:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-12 17:49:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 274. [2024-11-12 17:49:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 221 states have (on average 1.0723981900452488) internal successors, (237), 217 states have internal predecessors, (237), 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-12 17:49:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 294 transitions. [2024-11-12 17:49:50,335 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 294 transitions. Word has length 56 [2024-11-12 17:49:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:50,335 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 294 transitions. [2024-11-12 17:49:50,336 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-12 17:49:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 294 transitions. [2024-11-12 17:49:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 17:49:50,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:50,337 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-11-12 17:49:50,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 17:49:50,541 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-12 17:49:50,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -692645514, now seen corresponding path program 2 times [2024-11-12 17:49:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683600228] [2024-11-12 17:49:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 17:49:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 17:49:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683600228] [2024-11-12 17:49:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683600228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416175028] [2024-11-12 17:49:50,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:49:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:50,833 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-12 17:49:50,834 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-12 17:49:50,878 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:49:50,878 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:49:50,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 17:49:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:49:50,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:49:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416175028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:51,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-12 17:49:51,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902601094] [2024-11-12 17:49:51,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:51,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 17:49:51,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 17:49:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-12 17:49:51,508 INFO L87 Difference]: Start difference. First operand 274 states and 294 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-12 17:49:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:51,759 INFO L93 Difference]: Finished difference Result 593 states and 678 transitions. [2024-11-12 17:49:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 17:49:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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 55 [2024-11-12 17:49:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:51,761 INFO L225 Difference]: With dead ends: 593 [2024-11-12 17:49:51,761 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 17:49:51,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 17:49:51,764 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:51,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:49:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 17:49:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-12 17:49:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 300 states have (on average 1.0366666666666666) internal successors, (311), 291 states have internal predecessors, (311), 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-12 17:49:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 389 transitions. [2024-11-12 17:49:51,787 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 389 transitions. Word has length 55 [2024-11-12 17:49:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 389 transitions. [2024-11-12 17:49:51,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 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-12 17:49:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 389 transitions. [2024-11-12 17:49:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 17:49:51,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:51,791 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1] [2024-11-12 17:49:51,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 17:49:51,998 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-12 17:49:51,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:51,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 955887606, now seen corresponding path program 3 times [2024-11-12 17:49:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794926014] [2024-11-12 17:49:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 17:49:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 11 proven. 275 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-12 17:49:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:49:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794926014] [2024-11-12 17:49:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794926014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:49:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675659587] [2024-11-12 17:49:52,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 17:49:52,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:49:52,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:49:52,970 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-12 17:49:52,971 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-12 17:49:53,044 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-12 17:49:53,044 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:49:53,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 17:49:53,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:49:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-12 17:49:53,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:49:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-12 17:49:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675659587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:49:57,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:49:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2024-11-12 17:49:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052850345] [2024-11-12 17:49:57,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:49:57,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-12 17:49:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:49:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-12 17:49:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2024-11-12 17:49:57,371 INFO L87 Difference]: Start difference. First operand 369 states and 389 transitions. Second operand has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 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-12 17:49:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:49:57,964 INFO L93 Difference]: Finished difference Result 1006 states and 1157 transitions. [2024-11-12 17:49:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-12 17:49:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 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 115 [2024-11-12 17:49:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:49:57,967 INFO L225 Difference]: With dead ends: 1006 [2024-11-12 17:49:57,968 INFO L226 Difference]: Without dead ends: 429 [2024-11-12 17:49:57,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2024-11-12 17:49:57,972 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:49:57,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 71 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:49:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-12 17:49:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-11-12 17:49:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 348 states have (on average 1.0316091954022988) internal successors, (359), 339 states have internal predecessors, (359), 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-12 17:49:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 449 transitions. [2024-11-12 17:49:58,000 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 449 transitions. Word has length 115 [2024-11-12 17:49:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:49:58,000 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 449 transitions. [2024-11-12 17:49:58,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 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-12 17:49:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 449 transitions. [2024-11-12 17:49:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-12 17:49:58,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:49:58,006 INFO L218 NwaCegarLoop]: trace histogram [35, 34, 34, 34, 34, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1] [2024-11-12 17:49:58,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:49:58,210 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-12 17:49:58,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 17:49:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:49:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1103718135, now seen corresponding path program 4 times [2024-11-12 17:49:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:49:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798728629] [2024-11-12 17:49:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:49:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:49:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 17:49:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:49:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:49:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 17:50:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:50:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 34 proven. 1265 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2024-11-12 17:50:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:50:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798728629] [2024-11-12 17:50:03,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798728629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:50:03,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771979041] [2024-11-12 17:50:03,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 17:50:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:50:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:50:03,162 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-12 17:50:03,164 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-12 17:50:03,306 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 17:50:03,307 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:50:03,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-12 17:50:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:50:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 1595 proven. 1344 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2024-11-12 17:50:05,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:50:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 1595 proven. 2290 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-12 17:50:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771979041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:50:58,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:50:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 51, 73] total 146 [2024-11-12 17:50:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838300668] [2024-11-12 17:50:58,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:50:58,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2024-11-12 17:50:58,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:50:58,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2024-11-12 17:50:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2199, Invalid=18971, Unknown=0, NotChecked=0, Total=21170 [2024-11-12 17:50:58,249 INFO L87 Difference]: Start difference. First operand 429 states and 449 transitions. Second operand has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (51), 25 states have call predecessors, (51), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) [2024-11-12 17:50:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:50:58,891 INFO L93 Difference]: Finished difference Result 429 states and 449 transitions. [2024-11-12 17:50:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 17:50:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (51), 25 states have call predecessors, (51), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) Word has length 290 [2024-11-12 17:50:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:50:58,893 INFO L225 Difference]: With dead ends: 429 [2024-11-12 17:50:58,893 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:50:58,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 504 SyntacticMatches, 23 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12821 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3033, Invalid=21773, Unknown=0, NotChecked=0, Total=24806 [2024-11-12 17:50:58,902 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 17:50:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 124 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 17:50:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:50:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:50:58,903 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-12 17:50:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:50:58,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2024-11-12 17:50:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:50:58,904 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:50:58,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (51), 25 states have call predecessors, (51), 46 states have return successors, (69), 46 states have call predecessors, (69), 26 states have call successors, (69) [2024-11-12 17:50:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:50:58,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:50:58,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 17:50:58,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 17:50:58,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 17:50:58,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 17:50:58,927 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-12 17:50:59,109 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-12 17:50:59,113 INFO L421 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2024-11-12 17:50:59,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:51:00,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:51:00,125 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:51:00,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:51:00 BoogieIcfgContainer [2024-11-12 17:51:00,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:51:00,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:51:00,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:51:00,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:51:00,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:49:45" (3/4) ... [2024-11-12 17:51:00,134 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:51:00,139 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-11-12 17:51:00,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 17:51:00,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:51:00,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:51:00,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:51:00,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:51:00,227 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:51:00,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:51:00,227 INFO L158 Benchmark]: Toolchain (without parser) took 75694.24ms. Allocated memory was 157.3MB in the beginning and 526.4MB in the end (delta: 369.1MB). Free memory was 121.2MB in the beginning and 283.8MB in the end (delta: -162.6MB). Peak memory consumption was 206.9MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,227 INFO L158 Benchmark]: CDTParser took 1.79ms. Allocated memory is still 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:51:00,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.27ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 109.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.96ms. Allocated memory is still 157.3MB. Free memory was 109.5MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,228 INFO L158 Benchmark]: Boogie Preprocessor took 27.54ms. Allocated memory is still 157.3MB. Free memory was 107.8MB in the beginning and 106.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,229 INFO L158 Benchmark]: RCFGBuilder took 291.55ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 96.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,229 INFO L158 Benchmark]: TraceAbstraction took 75030.21ms. Allocated memory was 157.3MB in the beginning and 526.4MB in the end (delta: 369.1MB). Free memory was 95.6MB in the beginning and 288.0MB in the end (delta: -192.3MB). Peak memory consumption was 295.1MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,230 INFO L158 Benchmark]: Witness Printer took 96.11ms. Allocated memory is still 526.4MB. Free memory was 288.0MB in the beginning and 283.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:51:00,232 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.79ms. Allocated memory is still 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.27ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 109.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.96ms. Allocated memory is still 157.3MB. Free memory was 109.5MB in the beginning and 107.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.54ms. Allocated memory is still 157.3MB. Free memory was 107.8MB in the beginning and 106.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.55ms. Allocated memory is still 157.3MB. Free memory was 106.5MB in the beginning and 96.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75030.21ms. Allocated memory was 157.3MB in the beginning and 526.4MB in the end (delta: 369.1MB). Free memory was 95.6MB in the beginning and 288.0MB in the end (delta: -192.3MB). Peak memory consumption was 295.1MB. Max. memory is 16.1GB. * Witness Printer took 96.11ms. Allocated memory is still 526.4MB. Free memory was 288.0MB in the beginning and 283.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 24 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 73.9s, OverallIterations: 11, TraceHistogramMax: 35, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 851 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 809 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2171 IncrementalHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 163 mSDtfsCounter, 2171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1066 SyntacticMatches, 23 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17752 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=10, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 68.6s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 4904 SizeOfPredicates, 52 NumberOfNonLiveVariables, 984 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 8788/15577 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: (((0 < x) || ((\result == 0) && (x == 0))) && (x <= 5)) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:51:00,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE