./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_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 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:13:58,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:13:58,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:13:58,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:13:58,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:13:58,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:13:58,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:13:58,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:13:58,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:13:58,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:13:58,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:13:58,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:13:58,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:13:58,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:13:58,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:13:58,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:13:58,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:13:58,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:13:58,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:13:58,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:13:58,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:13:58,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:13:58,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:13:58,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:13:58,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:13:58,797 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:13:58,798 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:13:58,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:13:58,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:13:58,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:13:58,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:13:58,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:13:58,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:13:58,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:13:58,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:13:58,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:13:58,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:13:58,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:13:58,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:13:58,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:13:58,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:13:58,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:13:58,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:13:58,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:13:58,814 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 -> 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 [2024-11-09 12:13:59,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:13:59,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:13:59,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:13:59,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:13:59,057 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:13:59,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2024-11-09 12:14:00,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:14:00,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:14:00,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2024-11-09 12:14:00,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416b4ca03/53cb6911f3e442e081815222c5437763/FLAG32764c5cc [2024-11-09 12:14:00,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416b4ca03/53cb6911f3e442e081815222c5437763 [2024-11-09 12:14:00,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:14:00,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:14:00,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:14:00,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:14:00,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:14:00,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:00" (1/1) ... [2024-11-09 12:14:00,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f3ea48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:00, skipping insertion in model container [2024-11-09 12:14:00,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:00" (1/1) ... [2024-11-09 12:14:01,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:14:01,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:14:01,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:14:01,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:14:01,223 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:14:01,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01 WrapperNode [2024-11-09 12:14:01,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:14:01,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:14:01,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:14:01,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:14:01,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,247 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2024-11-09 12:14:01,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:14:01,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:14:01,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:14:01,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:14:01,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,277 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 12:14:01,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:14:01,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:14:01,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:14:01,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:14:01,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (1/1) ... [2024-11-09 12:14:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:14:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:01,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:14:01,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:14:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:14:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:14:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-11-09 12:14:01,361 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-11-09 12:14:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:14:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:14:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-09 12:14:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-09 12:14:01,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:14:01,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:14:01,544 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 12:14:01,545 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:14:01,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:14:01,555 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 12:14:01,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:01 BoogieIcfgContainer [2024-11-09 12:14:01,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:14:01,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:14:01,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:14:01,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:14:01,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:14:00" (1/3) ... [2024-11-09 12:14:01,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5cb8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:01, skipping insertion in model container [2024-11-09 12:14:01,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:01" (2/3) ... [2024-11-09 12:14:01,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c5cb8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:01, skipping insertion in model container [2024-11-09 12:14:01,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:01" (3/3) ... [2024-11-09 12:14:01,562 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2024-11-09 12:14:01,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:14:01,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 12:14:01,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:14:01,650 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;@16ec3b27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:14:01,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 12:14:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:14:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:14:01,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:01,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:14:01,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:01,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1363745714, now seen corresponding path program 1 times [2024-11-09 12:14:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705465998] [2024-11-09 12:14:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:01,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:01,942 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-09 12:14:01,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705465998] [2024-11-09 12:14:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705465998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:14:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287893639] [2024-11-09 12:14:01,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:14:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:01,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:14:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:14:01,983 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-09 12:14:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:02,100 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-09 12:14:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:14:02,103 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-09 12:14:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:02,110 INFO L225 Difference]: With dead ends: 60 [2024-11-09 12:14:02,110 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 12:14:02,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:14:02,116 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:02,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 127 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 12:14:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-09 12:14:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:14:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-09 12:14:02,153 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2024-11-09 12:14:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:02,154 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-09 12:14:02,154 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-09 12:14:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-09 12:14:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 12:14:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:02,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:14:02,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:02,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -673555755, now seen corresponding path program 1 times [2024-11-09 12:14:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501948237] [2024-11-09 12:14:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:02,251 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-09 12:14:02,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501948237] [2024-11-09 12:14:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501948237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:02,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:14:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316021319] [2024-11-09 12:14:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:02,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:14:02,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:14:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:14:02,254 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-09 12:14:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:02,295 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-09 12:14:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:14:02,297 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-09 12:14:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:02,298 INFO L225 Difference]: With dead ends: 42 [2024-11-09 12:14:02,298 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 12:14:02,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:14:02,299 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:02,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 12:14:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-09 12:14:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 12:14:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-09 12:14:02,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 7 [2024-11-09 12:14:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:02,311 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-09 12:14:02,312 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-09 12:14:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-09 12:14:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 12:14:02,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:02,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:02,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:14:02,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1526536194, now seen corresponding path program 1 times [2024-11-09 12:14:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839115619] [2024-11-09 12:14:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:02,408 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-09 12:14:02,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839115619] [2024-11-09 12:14:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839115619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:14:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171047522] [2024-11-09 12:14:02,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:02,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:14:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:14:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:14:02,411 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:02,510 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2024-11-09 12:14:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:14:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 12:14:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:02,513 INFO L225 Difference]: With dead ends: 62 [2024-11-09 12:14:02,513 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 12:14:02,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:14:02,514 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:02,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 12:14:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-09 12:14:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 12:14:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-11-09 12:14:02,521 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 11 [2024-11-09 12:14:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-11-09 12:14:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-11-09 12:14:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 12:14:02,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:02,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 12:14:02,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash 77981796, now seen corresponding path program 1 times [2024-11-09 12:14:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555439483] [2024-11-09 12:14:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:02,612 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-09 12:14:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:02,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555439483] [2024-11-09 12:14:02,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555439483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:02,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:02,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:14:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272022672] [2024-11-09 12:14:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:02,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:14:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:02,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:14:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:14:02,615 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:02,704 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-09 12:14:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:14:02,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 12:14:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:02,706 INFO L225 Difference]: With dead ends: 53 [2024-11-09 12:14:02,708 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 12:14:02,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:14:02,711 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:02,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 12:14:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-09 12:14:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 12:14:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-09 12:14:02,726 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 12 [2024-11-09 12:14:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:02,726 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-09 12:14:02,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-09 12:14:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 12:14:02,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:02,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:02,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:14:02,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -182979434, now seen corresponding path program 1 times [2024-11-09 12:14:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:02,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153177445] [2024-11-09 12:14:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:02,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:02,867 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-09 12:14:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153177445] [2024-11-09 12:14:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153177445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674915632] [2024-11-09 12:14:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:02,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:02,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:02,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:14:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:02,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 12:14:02,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:03,022 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-09 12:14:03,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:03,149 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-09 12:14:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674915632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:03,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 12:14:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858862970] [2024-11-09 12:14:03,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:03,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 12:14:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 12:14:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:14:03,156 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:03,332 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-09 12:14:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 12:14:03,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 12:14:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:03,334 INFO L225 Difference]: With dead ends: 109 [2024-11-09 12:14:03,334 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 12:14:03,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-09 12:14:03,335 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:03,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 248 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 12:14:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2024-11-09 12:14:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 62 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 12:14:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-11-09 12:14:03,356 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 16 [2024-11-09 12:14:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:03,356 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-11-09 12:14:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-11-09 12:14:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 12:14:03,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:03,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:03,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:14:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:03,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 858638830, now seen corresponding path program 1 times [2024-11-09 12:14:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254598401] [2024-11-09 12:14:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 12:14:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 12:14:03,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254598401] [2024-11-09 12:14:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254598401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:03,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:14:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859386067] [2024-11-09 12:14:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:03,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:14:03,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:14:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:14:03,672 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:14:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:03,688 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2024-11-09 12:14:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:14:03,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-09 12:14:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:03,690 INFO L225 Difference]: With dead ends: 92 [2024-11-09 12:14:03,692 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 12:14:03,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:14:03,693 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:03,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 12:14:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 12:14:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 72 states have internal predecessors, (87), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 12:14:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2024-11-09 12:14:03,706 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 24 [2024-11-09 12:14:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:03,706 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2024-11-09 12:14:03,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:14:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2024-11-09 12:14:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 12:14:03,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:03,708 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:03,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:14:03,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1790531986, now seen corresponding path program 1 times [2024-11-09 12:14:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928999692] [2024-11-09 12:14:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 12:14:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:14:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928999692] [2024-11-09 12:14:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928999692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:03,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 12:14:03,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148770966] [2024-11-09 12:14:03,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:03,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:14:03,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:03,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:14:03,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:14:03,802 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:14:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:03,844 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2024-11-09 12:14:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:14:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 12:14:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:03,846 INFO L225 Difference]: With dead ends: 102 [2024-11-09 12:14:03,846 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 12:14:03,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:14:03,847 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:03,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 12:14:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 12:14:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.25) internal successors, (95), 80 states have internal predecessors, (95), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 12:14:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2024-11-09 12:14:03,858 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 29 [2024-11-09 12:14:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:03,858 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2024-11-09 12:14:03,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 12:14:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2024-11-09 12:14:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 12:14:03,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:03,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:03,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:14:03,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:03,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1502278371, now seen corresponding path program 1 times [2024-11-09 12:14:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059563840] [2024-11-09 12:14:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 12:14:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 12:14:03,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:03,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059563840] [2024-11-09 12:14:03,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059563840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:03,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:03,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:14:03,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686990593] [2024-11-09 12:14:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:03,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:14:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:14:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:14:03,893 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:03,904 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2024-11-09 12:14:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:14:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 12:14:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:03,905 INFO L225 Difference]: With dead ends: 100 [2024-11-09 12:14:03,905 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 12:14:03,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:14:03,906 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 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-09 12:14:03,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 12:14:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 12:14:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 79 states have internal predecessors, (92), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 12:14:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-09 12:14:03,917 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 29 [2024-11-09 12:14:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:03,917 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-09 12:14:03,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-09 12:14:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 12:14:03,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:03,918 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 12:14:03,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 12:14:03,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:03,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2091519942, now seen corresponding path program 1 times [2024-11-09 12:14:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243515864] [2024-11-09 12:14:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243515864] [2024-11-09 12:14:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243515864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200430963] [2024-11-09 12:14:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:04,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:04,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:04,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:14:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:04,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 12:14:04,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:04,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200430963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:04,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-11-09 12:14:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736602911] [2024-11-09 12:14:04,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:04,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 12:14:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 12:14:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-11-09 12:14:04,403 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:04,746 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2024-11-09 12:14:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 12:14:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 12:14:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:04,748 INFO L225 Difference]: With dead ends: 242 [2024-11-09 12:14:04,749 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 12:14:04,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 12:14:04,751 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 301 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:04,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 419 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:14:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 12:14:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2024-11-09 12:14:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 155 states have internal predecessors, (183), 15 states have call successors, (15), 14 states have call predecessors, (15), 22 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-09 12:14:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2024-11-09 12:14:04,783 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 31 [2024-11-09 12:14:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2024-11-09 12:14:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2024-11-09 12:14:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 12:14:04,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:04,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:04,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 12:14:04,984 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,SelfDestructingSolverStorable8 [2024-11-09 12:14:04,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:04,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -308357491, now seen corresponding path program 1 times [2024-11-09 12:14:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225166175] [2024-11-09 12:14:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 12:14:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:14:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225166175] [2024-11-09 12:14:05,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225166175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:05,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:05,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 12:14:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561905520] [2024-11-09 12:14:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:05,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:14:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:14:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:14:05,186 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:05,219 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2024-11-09 12:14:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:14:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-09 12:14:05,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:05,223 INFO L225 Difference]: With dead ends: 223 [2024-11-09 12:14:05,223 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 12:14:05,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:14:05,224 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:05,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 12:14:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2024-11-09 12:14:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 159 states have internal predecessors, (187), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-09 12:14:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2024-11-09 12:14:05,245 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 40 [2024-11-09 12:14:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:05,246 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2024-11-09 12:14:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2024-11-09 12:14:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 12:14:05,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:05,247 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 12:14:05,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1422197, now seen corresponding path program 1 times [2024-11-09 12:14:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046826347] [2024-11-09 12:14:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 12:14:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 12:14:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046826347] [2024-11-09 12:14:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046826347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:14:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754723391] [2024-11-09 12:14:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:05,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:14:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:14:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:14:05,289 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:05,305 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2024-11-09 12:14:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:14:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-09 12:14:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:05,307 INFO L225 Difference]: With dead ends: 199 [2024-11-09 12:14:05,307 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 12:14:05,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:14:05,308 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 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-09 12:14:05,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 12:14:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-09 12:14:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 156 states have (on average 1.1538461538461537) internal successors, (180), 158 states have internal predecessors, (180), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-09 12:14:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2024-11-09 12:14:05,323 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 44 [2024-11-09 12:14:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:05,323 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2024-11-09 12:14:05,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2024-11-09 12:14:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 12:14:05,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:05,325 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:05,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 12:14:05,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:05,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash -44088030, now seen corresponding path program 1 times [2024-11-09 12:14:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684789296] [2024-11-09 12:14:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:05,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 12:14:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 12:14:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684789296] [2024-11-09 12:14:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684789296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:14:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:14:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:14:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010789762] [2024-11-09 12:14:05,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:14:05,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:14:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:14:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:14:05,436 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:05,486 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2024-11-09 12:14:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:14:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-09 12:14:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:05,488 INFO L225 Difference]: With dead ends: 247 [2024-11-09 12:14:05,488 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 12:14:05,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:14:05,489 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:05,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 12:14:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-09 12:14:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.123076923076923) internal successors, (219), 196 states have internal predecessors, (219), 15 states have call successors, (15), 14 states have call predecessors, (15), 32 states have return successors, (35), 35 states have call predecessors, (35), 14 states have call successors, (35) [2024-11-09 12:14:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2024-11-09 12:14:05,503 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 45 [2024-11-09 12:14:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:05,503 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2024-11-09 12:14:05,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:14:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2024-11-09 12:14:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 12:14:05,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:05,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:05,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 12:14:05,506 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 91465175, now seen corresponding path program 1 times [2024-11-09 12:14:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921316719] [2024-11-09 12:14:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 12:14:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:14:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921316719] [2024-11-09 12:14:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921316719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852457681] [2024-11-09 12:14:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:05,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:05,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:05,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:05,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:14:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:05,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 12:14:05,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:14:05,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:14:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852457681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:05,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-09 12:14:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955502363] [2024-11-09 12:14:05,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 12:14:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 12:14:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:14:05,876 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 12:14:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:05,938 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2024-11-09 12:14:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 12:14:05,938 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2024-11-09 12:14:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:05,940 INFO L225 Difference]: With dead ends: 346 [2024-11-09 12:14:05,940 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 12:14:05,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 12:14:05,942 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:05,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:14:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 12:14:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 271. [2024-11-09 12:14:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.1069767441860465) internal successors, (238), 216 states have internal predecessors, (238), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2024-11-09 12:14:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 293 transitions. [2024-11-09 12:14:05,961 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 293 transitions. Word has length 45 [2024-11-09 12:14:05,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:05,961 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 293 transitions. [2024-11-09 12:14:05,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 12:14:05,961 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 293 transitions. [2024-11-09 12:14:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 12:14:05,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:05,962 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 12:14:05,980 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-09 12:14:06,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:06,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:06,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:06,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1373606826, now seen corresponding path program 1 times [2024-11-09 12:14:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386657857] [2024-11-09 12:14:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:06,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 12:14:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:14:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386657857] [2024-11-09 12:14:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386657857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294745260] [2024-11-09 12:14:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:06,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:06,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:06,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 12:14:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:06,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 12:14:06,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 12:14:06,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:14:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294745260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:07,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:07,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 17] total 23 [2024-11-09 12:14:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234920008] [2024-11-09 12:14:07,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:07,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 12:14:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 12:14:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-09 12:14:07,630 INFO L87 Difference]: Start difference. First operand 271 states and 293 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-09 12:14:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:07,845 INFO L93 Difference]: Finished difference Result 459 states and 496 transitions. [2024-11-09 12:14:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 12:14:07,846 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) Word has length 60 [2024-11-09 12:14:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:07,847 INFO L225 Difference]: With dead ends: 459 [2024-11-09 12:14:07,847 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 12:14:07,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2024-11-09 12:14:07,849 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 106 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:07,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 271 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 12:14:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-09 12:14:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.0883720930232559) internal successors, (234), 216 states have internal predecessors, (234), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2024-11-09 12:14:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 289 transitions. [2024-11-09 12:14:07,867 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 289 transitions. Word has length 60 [2024-11-09 12:14:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:07,868 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 289 transitions. [2024-11-09 12:14:07,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 21 states have internal predecessors, (68), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-09 12:14:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 289 transitions. [2024-11-09 12:14:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 12:14:07,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:07,869 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2024-11-09 12:14:07,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 12:14:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:08,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash -944165366, now seen corresponding path program 2 times [2024-11-09 12:14:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297446255] [2024-11-09 12:14:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297446255] [2024-11-09 12:14:08,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297446255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:08,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625332432] [2024-11-09 12:14:08,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:14:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:08,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:08,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 12:14:08,694 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:14:08,694 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:14:08,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 12:14:08,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:08,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625332432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:09,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2024-11-09 12:14:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045847708] [2024-11-09 12:14:09,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-09 12:14:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 12:14:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 12:14:09,480 INFO L87 Difference]: Start difference. First operand 271 states and 289 transitions. Second operand has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:10,508 INFO L93 Difference]: Finished difference Result 591 states and 615 transitions. [2024-11-09 12:14:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-09 12:14:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 12:14:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:10,511 INFO L225 Difference]: With dead ends: 591 [2024-11-09 12:14:10,511 INFO L226 Difference]: Without dead ends: 589 [2024-11-09 12:14:10,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 12:14:10,517 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 780 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:10,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 660 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:14:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-09 12:14:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 564. [2024-11-09 12:14:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 450 states have (on average 1.0844444444444445) internal successors, (488), 450 states have internal predecessors, (488), 28 states have call successors, (28), 27 states have call predecessors, (28), 82 states have return successors, (86), 86 states have call predecessors, (86), 27 states have call successors, (86) [2024-11-09 12:14:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 602 transitions. [2024-11-09 12:14:10,559 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 602 transitions. Word has length 66 [2024-11-09 12:14:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:10,560 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 602 transitions. [2024-11-09 12:14:10,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 602 transitions. [2024-11-09 12:14:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 12:14:10,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:10,561 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-11-09 12:14:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 12:14:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 12:14:10,767 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:10,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1023813575, now seen corresponding path program 1 times [2024-11-09 12:14:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:10,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736978742] [2024-11-09 12:14:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 12:14:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 12:14:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 12:14:11,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736978742] [2024-11-09 12:14:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736978742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357806810] [2024-11-09 12:14:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:11,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:11,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:11,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:11,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 12:14:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:11,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 12:14:11,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:14:11,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 12:14:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357806810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:12,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:12,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 38 [2024-11-09 12:14:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022646983] [2024-11-09 12:14:12,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:12,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 12:14:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 12:14:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 12:14:12,911 INFO L87 Difference]: Start difference. First operand 564 states and 602 transitions. Second operand has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 12:14:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:13,521 INFO L93 Difference]: Finished difference Result 590 states and 628 transitions. [2024-11-09 12:14:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 12:14:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 70 [2024-11-09 12:14:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:13,523 INFO L225 Difference]: With dead ends: 590 [2024-11-09 12:14:13,523 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 12:14:13,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=2255, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 12:14:13,527 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 195 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:14:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 12:14:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-09 12:14:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2024-11-09 12:14:13,538 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 70 [2024-11-09 12:14:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2024-11-09 12:14:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 12:14:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2024-11-09 12:14:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 12:14:13,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:13,542 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1] [2024-11-09 12:14:13,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 12:14:13,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 12:14:13,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:13,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1735112018, now seen corresponding path program 2 times [2024-11-09 12:14:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874678260] [2024-11-09 12:14:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874678260] [2024-11-09 12:14:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874678260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423983931] [2024-11-09 12:14:15,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:14:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:15,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:15,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 12:14:15,394 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:14:15,394 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:14:15,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 12:14:15,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:15,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423983931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:17,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:17,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2024-11-09 12:14:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055553761] [2024-11-09 12:14:17,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:17,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-11-09 12:14:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-11-09 12:14:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2024-11-09 12:14:17,466 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:19,421 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2024-11-09 12:14:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-11-09 12:14:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-09 12:14:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:19,423 INFO L225 Difference]: With dead ends: 277 [2024-11-09 12:14:19,423 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 12:14:19,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2024-11-09 12:14:19,430 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 677 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:19,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 99 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 12:14:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 12:14:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-11-09 12:14:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.0092165898617511) internal successors, (219), 218 states have internal predecessors, (219), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2024-11-09 12:14:19,446 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 131 [2024-11-09 12:14:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2024-11-09 12:14:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2024-11-09 12:14:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-09 12:14:19,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:19,453 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1] [2024-11-09 12:14:19,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 12:14:19,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:19,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -941956646, now seen corresponding path program 3 times [2024-11-09 12:14:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261544177] [2024-11-09 12:14:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261544177] [2024-11-09 12:14:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261544177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713975597] [2024-11-09 12:14:24,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:14:24,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:24,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:24,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:24,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 12:14:24,677 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2024-11-09 12:14:24,678 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:14:24,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 12:14:24,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:25,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713975597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:30,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2024-11-09 12:14:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109874701] [2024-11-09 12:14:30,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2024-11-09 12:14:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2024-11-09 12:14:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2024-11-09 12:14:30,821 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:36,894 INFO L93 Difference]: Finished difference Result 542 states and 593 transitions. [2024-11-09 12:14:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2024-11-09 12:14:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2024-11-09 12:14:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:36,899 INFO L225 Difference]: With dead ends: 542 [2024-11-09 12:14:36,899 INFO L226 Difference]: Without dead ends: 540 [2024-11-09 12:14:36,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2024-11-09 12:14:36,909 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1605 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:36,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 110 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 12:14:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-09 12:14:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2024-11-09 12:14:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 429 states have (on average 1.0046620046620047) internal successors, (431), 430 states have internal predecessors, (431), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 538 transitions. [2024-11-09 12:14:36,950 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 538 transitions. Word has length 266 [2024-11-09 12:14:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:36,950 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 538 transitions. [2024-11-09 12:14:36,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 538 transitions. [2024-11-09 12:14:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-09 12:14:36,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:14:36,961 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1] [2024-11-09 12:14:36,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 12:14:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 12:14:37,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 12:14:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:14:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -640380494, now seen corresponding path program 3 times [2024-11-09 12:14:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:14:37,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819026961] [2024-11-09 12:14:37,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:14:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:14:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:14:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 0 proven. 13676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:14:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:14:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819026961] [2024-11-09 12:14:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819026961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:14:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802174386] [2024-11-09 12:14:56,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 12:14:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:56,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:14:56,342 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:14:56,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 12:14:56,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2024-11-09 12:14:56,486 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:14:56,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 12:14:56,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:14:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2024-11-09 12:14:57,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:14:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2024-11-09 12:14:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802174386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:14:57,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:14:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 15, 15] total 228 [2024-11-09 12:14:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212933058] [2024-11-09 12:14:57,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:14:57,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 228 states [2024-11-09 12:14:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:14:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2024-11-09 12:14:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6590, Invalid=45166, Unknown=0, NotChecked=0, Total=51756 [2024-11-09 12:14:57,411 INFO L87 Difference]: Start difference. First operand 538 states and 538 transitions. Second operand has 228 states, 226 states have (on average 2.02212389380531) internal successors, (457), 116 states have internal predecessors, (457), 113 states have call successors, (114), 113 states have call predecessors, (114), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:14:57,807 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2024-11-09 12:14:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 12:14:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 228 states, 226 states have (on average 2.02212389380531) internal successors, (457), 116 states have internal predecessors, (457), 113 states have call successors, (114), 113 states have call predecessors, (114), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 531 [2024-11-09 12:14:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:14:57,810 INFO L225 Difference]: With dead ends: 538 [2024-11-09 12:14:57,810 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:14:57,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1048 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19687 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=7238, Invalid=47284, Unknown=0, NotChecked=0, Total=54522 [2024-11-09 12:14:57,820 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 79 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:14:57,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 123 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:14:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:14:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:14:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:14:57,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2024-11-09 12:14:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:14:57,822 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:14:57,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 228 states, 226 states have (on average 2.02212389380531) internal successors, (457), 116 states have internal predecessors, (457), 113 states have call successors, (114), 113 states have call predecessors, (114), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 12:14:57,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:14:57,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:14:57,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 12:14:57,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 12:14:57,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 12:14:57,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 12:14:57,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 12:14:57,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 12:14:57,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 12:14:57,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 12:14:57,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 12:14:58,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:14:58,031 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:14:58,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:14:59,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:14:59,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 12:14:59,117 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 12:14:59,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:14:59 BoogieIcfgContainer [2024-11-09 12:14:59,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:14:59,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:14:59,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:14:59,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:14:59,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:01" (3/4) ... [2024-11-09 12:14:59,123 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:14:59,128 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2024-11-09 12:14:59,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-11-09 12:14:59,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 12:14:59,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:14:59,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:14:59,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:14:59,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:14:59,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:14:59,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:14:59,240 INFO L158 Benchmark]: Toolchain (without parser) took 58258.61ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 70.0MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,242 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 123.7MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:14:59,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.06ms. Allocated memory is still 123.7MB. Free memory was 69.7MB in the beginning and 57.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.78ms. Allocated memory is still 123.7MB. Free memory was 57.8MB in the beginning and 56.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,243 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 123.7MB. Free memory was 56.5MB in the beginning and 55.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:14:59,243 INFO L158 Benchmark]: RCFGBuilder took 270.49ms. Allocated memory is still 123.7MB. Free memory was 54.7MB in the beginning and 43.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,244 INFO L158 Benchmark]: TraceAbstraction took 57561.70ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 43.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 956.0MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,244 INFO L158 Benchmark]: Witness Printer took 119.70ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 12:14:59,245 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74ms. Allocated memory is still 123.7MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.06ms. Allocated memory is still 123.7MB. Free memory was 69.7MB in the beginning and 57.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.78ms. Allocated memory is still 123.7MB. Free memory was 57.8MB in the beginning and 56.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 123.7MB. Free memory was 56.5MB in the beginning and 55.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.49ms. Allocated memory is still 123.7MB. Free memory was 54.7MB in the beginning and 43.7MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57561.70ms. Allocated memory was 123.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 43.1MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 956.0MB. Max. memory is 16.1GB. * Witness Printer took 119.70ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB 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 - 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: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 56.4s, OverallIterations: 19, TraceHistogramMax: 53, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3926 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3919 mSDsluCounter, 3250 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2823 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3939 IncrementalHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 427 mSDtfsCounter, 3939 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3191 GetRequests, 2201 SyntacticMatches, 16 SemanticMatches, 974 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62643 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=15, InterpolantAutomatonStates: 527, 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, 19 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 41.2s InterpolantComputationTime, 2679 NumberOfCodeBlocks, 2429 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3858 ConstructedInterpolants, 0 QuantifiedInterpolants, 12466 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 27727/54493 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 8 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2. Requires: (((2 == x) || (x == 0)) || (4 == x)) Ensures: (((\result == 0) || (x != 0)) && (((2 == x) || (x == 0)) || (4 == x))) - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Requires: (((x == 1) || (x == 3)) || (5 == x)) Ensures: (((x == 1) || (x == 3)) || (5 == x)) RESULT: Ultimate proved your program to be correct! [2024-11-09 12:14:59,289 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