./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:05:23,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:05:23,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 13:05:23,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:05:23,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:05:23,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:05:23,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:05:23,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:05:23,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:05:23,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:05:23,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:05:23,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:05:23,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:05:23,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:05:23,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:05:23,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:05:23,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:05:23,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:05:23,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:05:23,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:05:23,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:05:23,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:05:23,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:05:23,883 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:05:23,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:05:23,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:05:23,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:05:23,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:05:23,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:05:23,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:05:23,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:05:23,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:05:23,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:05:23,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:05:23,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:05:23,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:05:23,888 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 [2024-10-13 13:05:24,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:05:24,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:05:24,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:05:24,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:05:24,126 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:05:24,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-10-13 13:05:25,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:05:25,526 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:05:25,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-10-13 13:05:25,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b250b3d7e/db02d460bcc041ebab472f157c99fceb/FLAGc33165ff4 [2024-10-13 13:05:25,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b250b3d7e/db02d460bcc041ebab472f157c99fceb [2024-10-13 13:05:25,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:05:25,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:05:25,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:05:25,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:05:25,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:05:25,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb5a79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25, skipping insertion in model container [2024-10-13 13:05:25,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:05:25,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:05:25,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:05:25,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:05:25,711 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:05:25,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25 WrapperNode [2024-10-13 13:05:25,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:05:25,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:05:25,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:05:25,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:05:25,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,732 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-10-13 13:05:25,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:05:25,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:05:25,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:05:25,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:05:25,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,746 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 13:05:25,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:05:25,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:05:25,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:05:25,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:05:25,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (1/1) ... [2024-10-13 13:05:25,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:05:25,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:25,797 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-10-13 13:05:25,805 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-10-13 13:05:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:05:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:05:25,913 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:05:25,915 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:05:25,999 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 13:05:26,000 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:05:26,022 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:05:26,026 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 13:05:26,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:05:26 BoogieIcfgContainer [2024-10-13 13:05:26,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:05:26,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:05:26,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:05:26,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:05:26,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:05:25" (1/3) ... [2024-10-13 13:05:26,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:05:26, skipping insertion in model container [2024-10-13 13:05:26,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:05:25" (2/3) ... [2024-10-13 13:05:26,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9962f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:05:26, skipping insertion in model container [2024-10-13 13:05:26,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:05:26" (3/3) ... [2024-10-13 13:05:26,037 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Nested.c [2024-10-13 13:05:26,050 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:05:26,051 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-13 13:05:26,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:05:26,102 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;@7e5cb5da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:05:26,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 13:05:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 2.0) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:05:26,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:05:26,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2364654, now seen corresponding path program 1 times [2024-10-13 13:05:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925577017] [2024-10-13 13:05:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925577017] [2024-10-13 13:05:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925577017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:05:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075703998] [2024-10-13 13:05:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,250 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 2.0) internal successors, (24), 20 states have internal predecessors, (24), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,304 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-10-13 13:05:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-10-13 13:05:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,312 INFO L225 Difference]: With dead ends: 50 [2024-10-13 13:05:26,312 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:05:26,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,316 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:05:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-13 13:05:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-13 13:05:26,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 4 [2024-10-13 13:05:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-13 13:05:26,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-13 13:05:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 13:05:26,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 13:05:26,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:05:26,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2364701, now seen corresponding path program 1 times [2024-10-13 13:05:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083257634] [2024-10-13 13:05:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083257634] [2024-10-13 13:05:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083257634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:05:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735121179] [2024-10-13 13:05:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,368 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,388 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-10-13 13:05:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-10-13 13:05:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,391 INFO L225 Difference]: With dead ends: 27 [2024-10-13 13:05:26,392 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 13:05:26,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,393 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 13:05:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 13:05:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-13 13:05:26,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 4 [2024-10-13 13:05:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,397 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-13 13:05:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-13 13:05:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 13:05:26,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:05:26,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2022487905, now seen corresponding path program 1 times [2024-10-13 13:05:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022945702] [2024-10-13 13:05:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022945702] [2024-10-13 13:05:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022945702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:05:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483471357] [2024-10-13 13:05:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,429 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,437 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-13 13:05:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-10-13 13:05:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,438 INFO L225 Difference]: With dead ends: 26 [2024-10-13 13:05:26,438 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 13:05:26,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,439 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 13:05:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 13:05:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-13 13:05:26,443 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2024-10-13 13:05:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,443 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-13 13:05:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-13 13:05:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 13:05:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:05:26,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1727384443, now seen corresponding path program 1 times [2024-10-13 13:05:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760234408] [2024-10-13 13:05:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760234408] [2024-10-13 13:05:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760234408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:05:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090897467] [2024-10-13 13:05:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,470 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,479 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-13 13:05:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2024-10-13 13:05:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,480 INFO L225 Difference]: With dead ends: 32 [2024-10-13 13:05:26,480 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 13:05:26,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,481 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 13:05:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 13:05:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-13 13:05:26,486 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2024-10-13 13:05:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,486 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-13 13:05:26,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-13 13:05:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 13:05:26,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:05:26,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2009310241, now seen corresponding path program 1 times [2024-10-13 13:05:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272385879] [2024-10-13 13:05:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272385879] [2024-10-13 13:05:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272385879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:05:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024145968] [2024-10-13 13:05:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:05:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:05:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:05:26,542 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,576 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-13 13:05:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:05:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2024-10-13 13:05:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,579 INFO L225 Difference]: With dead ends: 31 [2024-10-13 13:05:26,579 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 13:05:26,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:05:26,580 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 13:05:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 13:05:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-10-13 13:05:26,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2024-10-13 13:05:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,589 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-10-13 13:05:26,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-10-13 13:05:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:05:26,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:05:26,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 402246416, now seen corresponding path program 1 times [2024-10-13 13:05:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533815936] [2024-10-13 13:05:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:05:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533815936] [2024-10-13 13:05:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533815936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:05:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868184822] [2024-10-13 13:05:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,640 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,653 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-10-13 13:05:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2024-10-13 13:05:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,656 INFO L225 Difference]: With dead ends: 29 [2024-10-13 13:05:26,656 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:05:26,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,657 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:05:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:05:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-13 13:05:26,661 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2024-10-13 13:05:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,661 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-13 13:05:26,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-13 13:05:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 13:05:26,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:05:26,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -415262923, now seen corresponding path program 1 times [2024-10-13 13:05:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832493445] [2024-10-13 13:05:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:05:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832493445] [2024-10-13 13:05:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832493445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 13:05:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267620135] [2024-10-13 13:05:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,697 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,708 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-13 13:05:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2024-10-13 13:05:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,709 INFO L225 Difference]: With dead ends: 43 [2024-10-13 13:05:26,709 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 13:05:26,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,710 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 13:05:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-13 13:05:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-13 13:05:26,715 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-13 13:05:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,715 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-13 13:05:26,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-13 13:05:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 13:05:26,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:05:26,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -415261481, now seen corresponding path program 1 times [2024-10-13 13:05:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954143442] [2024-10-13 13:05:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:05:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954143442] [2024-10-13 13:05:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954143442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:26,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:26,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:05:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669668926] [2024-10-13 13:05:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:26,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,757 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:26,771 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-13 13:05:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2024-10-13 13:05:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:26,772 INFO L225 Difference]: With dead ends: 39 [2024-10-13 13:05:26,772 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 13:05:26,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:26,773 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:26,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 13:05:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2024-10-13 13:05:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-10-13 13:05:26,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2024-10-13 13:05:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:26,782 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-13 13:05:26,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-10-13 13:05:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:05:26,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:26,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:26,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:05:26,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash 365677081, now seen corresponding path program 1 times [2024-10-13 13:05:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23744593] [2024-10-13 13:05:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23744593] [2024-10-13 13:05:26,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23744593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290456331] [2024-10-13 13:05:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:26,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:26,823 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-10-13 13:05:26,824 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-10-13 13:05:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:26,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 13:05:26,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:26,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:27,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290456331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:27,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-13 13:05:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627649471] [2024-10-13 13:05:27,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:27,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:05:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:05:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:05:27,004 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:27,034 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-10-13 13:05:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:05:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 14 [2024-10-13 13:05:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:27,035 INFO L225 Difference]: With dead ends: 87 [2024-10-13 13:05:27,035 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 13:05:27,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:05:27,036 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 50 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-10-13 13:05:27,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 13:05:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-10-13 13:05:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.146341463414634) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-10-13 13:05:27,052 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2024-10-13 13:05:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:27,054 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-10-13 13:05:27,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-10-13 13:05:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:05:27,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:27,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-13 13:05:27,068 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-10-13 13:05:27,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:27,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1523743214, now seen corresponding path program 1 times [2024-10-13 13:05:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955968500] [2024-10-13 13:05:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 13:05:27,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955968500] [2024-10-13 13:05:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955968500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:05:27,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:05:27,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023665496] [2024-10-13 13:05:27,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:27,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:05:27,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:05:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:27,297 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:27,313 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-13 13:05:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:05:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2024-10-13 13:05:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:27,314 INFO L225 Difference]: With dead ends: 84 [2024-10-13 13:05:27,315 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 13:05:27,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:05:27,316 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:27,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 13:05:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2024-10-13 13:05:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-13 13:05:27,329 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 23 [2024-10-13 13:05:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:27,330 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-13 13:05:27,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-13 13:05:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 13:05:27,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:27,333 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2024-10-13 13:05:27,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:05:27,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:27,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1371586555, now seen corresponding path program 2 times [2024-10-13 13:05:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597340342] [2024-10-13 13:05:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597340342] [2024-10-13 13:05:27,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597340342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838742660] [2024-10-13 13:05:27,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:05:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:27,439 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-10-13 13:05:27,441 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-10-13 13:05:27,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:05:27,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:27,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 13:05:27,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:27,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838742660] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:27,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:27,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 13:05:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799199134] [2024-10-13 13:05:27,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:05:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:05:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:05:27,641 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:27,690 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-10-13 13:05:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:05:27,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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) Word has length 35 [2024-10-13 13:05:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:27,691 INFO L225 Difference]: With dead ends: 119 [2024-10-13 13:05:27,692 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 13:05:27,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:05:27,692 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:27,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 13:05:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-13 13:05:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0940170940170941) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-10-13 13:05:27,701 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 35 [2024-10-13 13:05:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:27,701 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-10-13 13:05:27,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-10-13 13:05:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 13:05:27,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:27,706 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1] [2024-10-13 13:05:27,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:05:27,909 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,SelfDestructingSolverStorable10 [2024-10-13 13:05:27,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1582553413, now seen corresponding path program 3 times [2024-10-13 13:05:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189022871] [2024-10-13 13:05:27,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:28,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189022871] [2024-10-13 13:05:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189022871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722295955] [2024-10-13 13:05:28,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:05:28,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:28,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:28,117 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-10-13 13:05:28,118 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-10-13 13:05:28,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-13 13:05:28,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:28,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:05:28,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:28,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:28,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722295955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:28,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-13 13:05:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893246475] [2024-10-13 13:05:28,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:28,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 13:05:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 13:05:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:05:28,537 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:28,638 INFO L93 Difference]: Finished difference Result 251 states and 284 transitions. [2024-10-13 13:05:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 13:05:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 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) Word has length 77 [2024-10-13 13:05:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:28,640 INFO L225 Difference]: With dead ends: 251 [2024-10-13 13:05:28,640 INFO L226 Difference]: Without dead ends: 250 [2024-10-13 13:05:28,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:05:28,641 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 158 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:28,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 208 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:05:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-13 13:05:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-13 13:05:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.0923694779116466) internal successors, (272), 249 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 272 transitions. [2024-10-13 13:05:28,666 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 272 transitions. Word has length 77 [2024-10-13 13:05:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 272 transitions. [2024-10-13 13:05:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.695652173913044) internal successors, (154), 23 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 272 transitions. [2024-10-13 13:05:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 13:05:28,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:28,671 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1] [2024-10-13 13:05:28,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:05:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:28,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:28,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1483318331, now seen corresponding path program 4 times [2024-10-13 13:05:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882031937] [2024-10-13 13:05:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:05:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:29,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882031937] [2024-10-13 13:05:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882031937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:29,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799912030] [2024-10-13 13:05:29,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 13:05:29,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:29,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:29,408 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-10-13 13:05:29,409 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-10-13 13:05:29,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 13:05:29,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:29,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 13:05:29,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 1129 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-10-13 13:05:29,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:05:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799912030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:05:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 36 [2024-10-13 13:05:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807223822] [2024-10-13 13:05:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:29,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:05:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:29,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:05:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 13:05:29,697 INFO L87 Difference]: Start difference. First operand 250 states and 272 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:29,806 INFO L93 Difference]: Finished difference Result 1418 states and 1593 transitions. [2024-10-13 13:05:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 13:05:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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) Word has length 161 [2024-10-13 13:05:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:29,810 INFO L225 Difference]: With dead ends: 1418 [2024-10-13 13:05:29,811 INFO L226 Difference]: Without dead ends: 1270 [2024-10-13 13:05:29,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 13:05:29,812 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:29,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:05:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-13 13:05:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1262. [2024-10-13 13:05:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.1245043616177637) internal successors, (1418), 1261 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1418 transitions. [2024-10-13 13:05:29,845 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1418 transitions. Word has length 161 [2024-10-13 13:05:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1418 transitions. [2024-10-13 13:05:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1418 transitions. [2024-10-13 13:05:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 13:05:29,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:29,850 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1] [2024-10-13 13:05:29,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 13:05:30,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:30,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -112008549, now seen corresponding path program 1 times [2024-10-13 13:05:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:30,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179695524] [2024-10-13 13:05:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-13 13:05:30,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179695524] [2024-10-13 13:05:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179695524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729691356] [2024-10-13 13:05:30,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:30,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:30,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:30,245 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-10-13 13:05:30,246 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-10-13 13:05:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:30,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:05:30,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-13 13:05:30,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 646 proven. 75 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-10-13 13:05:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729691356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:30,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-10-13 13:05:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753970207] [2024-10-13 13:05:30,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:30,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:05:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:05:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:05:30,453 INFO L87 Difference]: Start difference. First operand 1262 states and 1418 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:30,510 INFO L93 Difference]: Finished difference Result 1434 states and 1609 transitions. [2024-10-13 13:05:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:05:30,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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) Word has length 169 [2024-10-13 13:05:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:30,512 INFO L225 Difference]: With dead ends: 1434 [2024-10-13 13:05:30,512 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 13:05:30,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 332 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:05:30,516 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:30,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 13:05:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2024-10-13 13:05:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.039301310043668) internal successors, (238), 229 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 238 transitions. [2024-10-13 13:05:30,543 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 238 transitions. Word has length 169 [2024-10-13 13:05:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 238 transitions. [2024-10-13 13:05:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 238 transitions. [2024-10-13 13:05:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 13:05:30,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:30,546 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1] [2024-10-13 13:05:30,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 13:05:30,747 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,SelfDestructingSolverStorable13 [2024-10-13 13:05:30,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:30,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1518226789, now seen corresponding path program 2 times [2024-10-13 13:05:30,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:30,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388626058] [2024-10-13 13:05:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:30,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 13:05:31,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:31,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388626058] [2024-10-13 13:05:31,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388626058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:31,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574729661] [2024-10-13 13:05:31,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 13:05:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:31,216 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-10-13 13:05:31,217 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-10-13 13:05:31,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 13:05:31,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:31,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 13:05:31,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 13:05:31,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 13:05:32,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574729661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:32,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:32,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2024-10-13 13:05:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131526007] [2024-10-13 13:05:32,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-13 13:05:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-13 13:05:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 13:05:32,185 INFO L87 Difference]: Start difference. First operand 230 states and 238 transitions. Second operand has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:32,317 INFO L93 Difference]: Finished difference Result 411 states and 442 transitions. [2024-10-13 13:05:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-13 13:05:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 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) Word has length 169 [2024-10-13 13:05:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:32,319 INFO L225 Difference]: With dead ends: 411 [2024-10-13 13:05:32,319 INFO L226 Difference]: Without dead ends: 410 [2024-10-13 13:05:32,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 13:05:32,321 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:32,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 304 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:05:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-13 13:05:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-10-13 13:05:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.02200488997555) internal successors, (418), 409 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 418 transitions. [2024-10-13 13:05:32,331 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 418 transitions. Word has length 169 [2024-10-13 13:05:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:32,332 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 418 transitions. [2024-10-13 13:05:32,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.191489361702128) internal successors, (338), 47 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 418 transitions. [2024-10-13 13:05:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-13 13:05:32,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:32,334 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 6, 5, 5, 5, 1, 1] [2024-10-13 13:05:32,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 13:05:32,535 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,SelfDestructingSolverStorable14 [2024-10-13 13:05:32,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 492636370, now seen corresponding path program 3 times [2024-10-13 13:05:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040503788] [2024-10-13 13:05:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:05:34,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040503788] [2024-10-13 13:05:34,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040503788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:34,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377402861] [2024-10-13 13:05:34,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 13:05:34,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:34,149 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-10-13 13:05:34,151 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-10-13 13:05:34,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2024-10-13 13:05:34,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:34,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 13:05:34,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:05:34,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:05:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:05:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377402861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:05:36,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:05:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2024-10-13 13:05:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825746626] [2024-10-13 13:05:36,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:05:36,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-13 13:05:36,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-13 13:05:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-13 13:05:36,847 INFO L87 Difference]: Start difference. First operand 410 states and 418 transitions. Second operand has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:37,165 INFO L93 Difference]: Finished difference Result 767 states and 822 transitions. [2024-10-13 13:05:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-13 13:05:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 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) Word has length 349 [2024-10-13 13:05:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:37,169 INFO L225 Difference]: With dead ends: 767 [2024-10-13 13:05:37,169 INFO L226 Difference]: Without dead ends: 766 [2024-10-13 13:05:37,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-13 13:05:37,171 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:37,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 624 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:05:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-10-13 13:05:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2024-10-13 13:05:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.011764705882353) internal successors, (774), 765 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 774 transitions. [2024-10-13 13:05:37,186 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 774 transitions. Word has length 349 [2024-10-13 13:05:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:37,187 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 774 transitions. [2024-10-13 13:05:37,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.347368421052631) internal successors, (698), 95 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 774 transitions. [2024-10-13 13:05:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-10-13 13:05:37,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:05:37,195 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 11, 10, 10, 10, 1, 1] [2024-10-13 13:05:37,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 13:05:37,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:37,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-13 13:05:37,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:05:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 124833051, now seen corresponding path program 4 times [2024-10-13 13:05:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:05:37,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182730486] [2024-10-13 13:05:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:05:37,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:05:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:05:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 0 proven. 32197 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 13:05:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:05:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182730486] [2024-10-13 13:05:43,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182730486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:05:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829946257] [2024-10-13 13:05:43,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 13:05:43,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:05:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:05:43,011 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-10-13 13:05:43,016 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-10-13 13:05:43,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 13:05:43,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 13:05:43,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:05:43,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:05:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 29535 proven. 0 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2024-10-13 13:05:44,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:05:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829946257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:05:44,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:05:44,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [95] total 107 [2024-10-13 13:05:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172710982] [2024-10-13 13:05:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:05:44,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:05:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:05:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:05:44,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-10-13 13:05:44,010 INFO L87 Difference]: Start difference. First operand 766 states and 774 transitions. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:05:44,066 INFO L93 Difference]: Finished difference Result 766 states and 774 transitions. [2024-10-13 13:05:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 13:05:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 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) Word has length 705 [2024-10-13 13:05:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:05:44,068 INFO L225 Difference]: With dead ends: 766 [2024-10-13 13:05:44,068 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:05:44,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-10-13 13:05:44,072 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:05:44,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:05:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:05:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:05:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:05:44,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2024-10-13 13:05:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:05:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:05:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:05:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:05:44,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:05:44,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-13 13:05:44,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-13 13:05:44,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-13 13:05:44,090 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-10-13 13:05:44,277 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,SelfDestructingSolverStorable16 [2024-10-13 13:05:44,280 INFO L407 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:05:44,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:05:46,588 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:05:46,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:05:46 BoogieIcfgContainer [2024-10-13 13:05:46,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:05:46,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:05:46,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:05:46,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:05:46,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:05:26" (3/4) ... [2024-10-13 13:05:46,650 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:05:46,656 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 13:05:46,656 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:05:46,656 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 13:05:46,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:05:46,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:05:46,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:05:46,738 INFO L158 Benchmark]: Toolchain (without parser) took 21191.77ms. Allocated memory was 159.4MB in the beginning and 713.0MB in the end (delta: 553.6MB). Free memory was 87.0MB in the beginning and 543.1MB in the end (delta: -456.0MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,738 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:05:46,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.32ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 75.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.40ms. Allocated memory is still 159.4MB. Free memory was 75.8MB in the beginning and 74.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,739 INFO L158 Benchmark]: Boogie Preprocessor took 30.66ms. Allocated memory is still 159.4MB. Free memory was 74.5MB in the beginning and 129.9MB in the end (delta: -55.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,739 INFO L158 Benchmark]: RCFGBuilder took 263.19ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 123.3MB in the end (delta: 6.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,740 INFO L158 Benchmark]: TraceAbstraction took 20616.22ms. Allocated memory was 159.4MB in the beginning and 713.0MB in the end (delta: 553.6MB). Free memory was 122.1MB in the beginning and 547.2MB in the end (delta: -425.2MB). Peak memory consumption was 426.1MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,740 INFO L158 Benchmark]: Witness Printer took 90.81ms. Allocated memory is still 713.0MB. Free memory was 547.2MB in the beginning and 543.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:05:46,741 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.15ms. Allocated memory is still 159.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.32ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 75.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.40ms. Allocated memory is still 159.4MB. Free memory was 75.8MB in the beginning and 74.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.66ms. Allocated memory is still 159.4MB. Free memory was 74.5MB in the beginning and 129.9MB in the end (delta: -55.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 263.19ms. Allocated memory is still 159.4MB. Free memory was 129.8MB in the beginning and 123.3MB in the end (delta: 6.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20616.22ms. Allocated memory was 159.4MB in the beginning and 713.0MB in the end (delta: 553.6MB). Free memory was 122.1MB in the beginning and 547.2MB in the end (delta: -425.2MB). Peak memory consumption was 426.1MB. Max. memory is 16.1GB. * Witness Printer took 90.81ms. Allocated memory is still 713.0MB. Free memory was 547.2MB in the beginning and 543.1MB 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.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: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: 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 1 procedures, 21 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 17, TraceHistogramMax: 95, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 1817 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1548 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 269 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2713 GetRequests, 2370 SyntacticMatches, 7 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1262occurred in iteration=13, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 3445 NumberOfCodeBlocks, 3445 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 4227 ConstructedInterpolants, 0 QuantifiedInterpolants, 11581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3153 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 39097/103123 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 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= c) && (j == 11)) && (c <= 2147483615)) && (i <= 9)) && (6 <= i)) || (((((c <= 27) && (0 <= c)) && (12 <= j)) && (2 <= i)) && (i <= 9))) || (((c == 0) && (i == 0)) && (3 == j))) || (((((0 <= c) && (7 == j)) && (c <= 40)) && (i <= 9)) && (4 <= i))) || (((((c <= 45) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (4 <= i))) || ((((j == 4) && (i == 0)) && (c <= 1)) && (0 <= c))) || (((((c <= 2147483627) && (0 <= c)) && (i <= 9)) && (8 <= i)) && (5 == j))) || (((((1 <= i) && (c <= 14)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((7 <= i) && (c <= 2147483616)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 33) && (0 <= c)) && (3 <= i)) && (9 == j)) && (i <= 9))) || (((((c <= 24) && (0 <= c)) && (2 <= i)) && (9 == j)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (c <= 31)) && (7 == j)) && (i <= 9))) || (((((c <= 38) && (0 <= c)) && (i <= 9)) && (5 == j)) && (4 <= i))) || (((((c <= 2147483611) && (0 <= c)) && (7 == j)) && (i <= 9)) && (6 <= i))) || (((((0 <= c) && (c <= 2147483614)) && (i <= 9)) && (j == 10)) && (6 <= i))) || (((((6 == j) && (0 <= c)) && (3 <= i)) && (i <= 9)) && (c <= 30))) || (((((0 <= c) && (j == 11)) && (c <= 26)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483607) && (0 <= c)) && (3 == j)) && (i <= 9)) && (6 <= i))) || (((((5 <= i) && (0 <= c)) && (c <= 2147483603)) && (i <= 9)) && (j == 8))) || (((((j == 4) && (1 <= i)) && (c <= 10)) && (0 <= c)) && (i <= 9))) || (((((c <= 43) && (0 <= c)) && (i <= 9)) && (j == 10)) && (4 <= i))) || (((((7 <= i) && (c <= 2147483620)) && (0 <= c)) && (7 == j)) && (i <= 9))) || ((((c <= 2147483637) && (6 == j)) && (9 == i)) && (0 <= c))) || (((((5 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483604))) || (((((c <= 2147483605) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483632) && (0 <= c)) && (i <= 9)) && (j == 10)) && (8 <= i))) || (((((0 <= c) && (c <= 20)) && (2 <= i)) && (i <= 9)) && (5 == j))) || (((((1 <= i) && (c <= 15)) && (0 <= c)) && (9 == j)) && (i <= 9))) || (((((c <= 25) && (0 <= c)) && (2 <= i)) && (i <= 9)) && (j == 10))) || (((((0 <= c) && (c <= 2147483612)) && (i <= 9)) && (6 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (c <= 6)) && (9 == j)) && (i <= 9))) || (((((j == 4) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 2147483617))) || (((((0 <= c) && (7 == j)) && (i <= 9)) && (c <= 2147483629)) && (8 <= i))) || (((((c <= 2147483606) && (5 <= i)) && (0 <= c)) && (j == 11)) && (i <= 9))) || (((((c <= 21) && (6 == j)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483600) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (5 == j))) || (((((c <= 36) && (0 <= c)) && (3 == j)) && (i <= 9)) && (4 <= i))) || (((((c <= 2147483613) && (0 <= c)) && (9 == j)) && (i <= 9)) && (6 <= i))) || (((((c <= 35) && (0 <= c)) && (3 <= i)) && (j == 11)) && (i <= 9))) || (((((0 <= c) && (c <= 8)) && (j == 11)) && (0 <= i)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (7 == j)) && (i <= 9)) && (c <= 13))) || (((((7 <= i) && (c <= 2147483625)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (c <= 2147483610)) && (i <= 9)) && (6 <= i))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483623)) && (i <= 9)) && (j == 10))) || (((((c <= 4) && (0 <= c)) && (0 <= i)) && (7 == j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (c <= 3))) || (((((c <= 2147483628) && (6 == j)) && (0 <= c)) && (i <= 9)) && (8 <= i))) || (((((j == 4) && (0 <= c)) && (i <= 9)) && (6 <= i)) && (c <= 2147483608))) || (((((c <= 2147483634) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (j == 11)) && (c <= 44)) && (i <= 9)) && (4 <= i))) || (((((0 <= c) && (i <= 9)) && (4 <= i)) && (c <= 41)) && (j == 8))) || (((((c <= 27) && (0 <= c)) && (3 <= i)) && (3 == j)) && (i <= 9))) || (((((5 <= i) && (c <= 2147483602)) && (0 <= c)) && (7 == j)) && (i <= 9))) || (((((j == 4) && (0 <= c)) && (c <= 2147483626)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (c <= 23)) && (2 <= i)) && (i <= 9)) && (j == 8))) || ((((9 == i) && (0 <= c)) && (12 <= j)) && (c <= 2147483643))) || (((((c <= 2147483616) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (6 <= i))) || (((((c <= 42) && (0 <= c)) && (9 == j)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (0 <= c)) && (i <= 9)) && (j == 10)) && (c <= 16))) || (((((0 <= c) && (i <= 9)) && (c <= 2147483630)) && (8 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (12 <= j)) && (c <= 9)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483618)) && (i <= 9)) && (5 == j))) || (((((j == 4) && (c <= 28)) && (0 <= c)) && (3 <= i)) && (i <= 9))) || (((((6 == j) && (c <= 39)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((j == 4) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 46))) || (((((1 <= i) && (0 <= c)) && (3 == j)) && (c <= 9)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (c <= 11)) && (i <= 9)) && (5 == j))) || (((((c <= 2147483607) && (5 <= i)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((c <= 2147483633) && (0 <= c)) && (j == 11)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 29)) && (5 == j))) || (((((7 <= i) && (c <= 2147483619)) && (6 == j)) && (0 <= c)) && (i <= 9))) || ((((9 == i) && (0 <= c)) && (j == 11)) && (c <= 2147483642))) || ((((c <= 2147483641) && (9 == i)) && (0 <= c)) && (j == 10))) || (((((j == 4) && (c <= 19)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || ((((9 == i) && (c <= 2147483634)) && (0 <= c)) && (3 == j))) || ((((9 == i) && (c <= 2147483638)) && (0 <= c)) && (7 == j))) || ((((9 == i) && (c <= 2147483639)) && (0 <= c)) && (j == 8))) || (((((c <= 5) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (j == 8))) || (((((1 <= i) && (0 <= c)) && (j == 11)) && (i <= 9)) && (c <= 17))) || ((((9 == i) && (0 <= c)) && (9 == j)) && (c <= 2147483640))) || (((((c <= 22) && (0 <= c)) && (7 == j)) && (2 <= i)) && (i <= 9))) || (((((c <= 36) && (0 <= c)) && (3 <= i)) && (12 <= j)) && (i <= 9))) || (((((0 <= c) && (0 <= i)) && (c <= 7)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483621) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((6 == j) && (5 <= i)) && (0 <= c)) && (c <= 2147483601)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483624)) && (j == 11)) && (i <= 9))) || ((((c <= 2147483636) && (9 == i)) && (0 <= c)) && (5 == j))) || (((((0 <= c) && (0 <= i)) && (c <= 2)) && (i <= 9)) && (5 == j))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (j == 10)) && (c <= 34))) || (((((0 <= c) && (3 == j)) && (2 <= i)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 32)) && (j == 8))) || (((((5 <= i) && (c <= 45)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 2147483625) && (0 <= c)) && (3 == j)) && (i <= 9)) && (8 <= i))) || (((((c <= 2147483631) && (0 <= c)) && (9 == j)) && (i <= 9)) && (8 <= i))) || (((((7 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483622))) || ((((j == 4) && (9 == i)) && (0 <= c)) && (c <= 2147483635))) || (((((1 <= i) && (0 <= c)) && (12 <= j)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (i <= 9)) && (5 == j)) && (6 <= i)) && (c <= 2147483609))) || (((((j == 4) && (c <= 37)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (6 == j)) && (0 <= c)) && (c <= 12)) && (i <= 9))) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((((((((((((c <= 2147483625) && (0 <= c)) && (8 <= i)) || (((0 <= c) && (2 <= i)) && (c <= 18))) || (((c <= 27) && (0 <= c)) && (3 <= i))) || (((5 <= i) && (c <= 45)) && (0 <= c))) || (((1 <= i) && (0 <= c)) && (c <= 9))) || (((7 <= i) && (c <= 2147483616)) && (0 <= c))) || (((c <= 2147483607) && (0 <= c)) && (6 <= i))) || (((c <= 2147483634) && (0 <= c)) && (9 <= i))) || (((c <= 36) && (0 <= c)) && (4 <= i))) || ((c == 0) && (i == 0))) || (((10 <= i) && (0 <= c)) && (c <= 2147483643))) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:05:46,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE