./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-crafted/Mysore-2.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-crafted/Mysore-2.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 e573de14d9788c77bce7065ed34a1586a64b72729dbf270f6aaf1ae9cdd54fd7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:57:49,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:57:49,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 12:57:49,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:57:49,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:57:49,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:57:49,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:57:49,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:57:49,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:57:49,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:57:49,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:57:49,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:57:49,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:57:49,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:57:49,901 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:57:49,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:57:49,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:57:49,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:57:49,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:57:49,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:57:49,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:57:49,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:57:49,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:57:49,904 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:57:49,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:57:49,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:57:49,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:57:49,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:57:49,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:57:49,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:57:49,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:57:49,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:57:49,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:57:49,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:57:49,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:57:49,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:57:49,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:57:49,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:57:49,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:57:49,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:57:49,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:57:49,913 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 -> e573de14d9788c77bce7065ed34a1586a64b72729dbf270f6aaf1ae9cdd54fd7 [2024-10-13 12:57:50,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:57:50,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:57:50,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:57:50,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:57:50,188 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:57:50,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Mysore-2.c [2024-10-13 12:57:51,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:57:51,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:57:51,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Mysore-2.c [2024-10-13 12:57:51,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019335b61/b94904b98e0a4021beda086bdc2892b2/FLAGef02ff496 [2024-10-13 12:57:51,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019335b61/b94904b98e0a4021beda086bdc2892b2 [2024-10-13 12:57:51,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:57:51,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:57:51,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:57:51,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:57:51,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:57:51,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:51" (1/1) ... [2024-10-13 12:57:51,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590e1211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:51, skipping insertion in model container [2024-10-13 12:57:51,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:57:51" (1/1) ... [2024-10-13 12:57:51,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:57:52,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:57:52,010 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:57:52,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:57:52,036 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:57:52,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52 WrapperNode [2024-10-13 12:57:52,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:57:52,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:57:52,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:57:52,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:57:52,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,066 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-10-13 12:57:52,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:57:52,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:57:52,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:57:52,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:57:52,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,081 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 12:57:52,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:57:52,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:57:52,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:57:52,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:57:52,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (1/1) ... [2024-10-13 12:57:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:57:52,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:52,127 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 12:57:52,134 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 12:57:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:57:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:57:52,260 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:57:52,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:57:52,364 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 12:57:52,364 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:57:52,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:57:52,385 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 12:57:52,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:52 BoogieIcfgContainer [2024-10-13 12:57:52,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:57:52,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:57:52,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:57:52,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:57:52,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:57:51" (1/3) ... [2024-10-13 12:57:52,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:52, skipping insertion in model container [2024-10-13 12:57:52,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:57:52" (2/3) ... [2024-10-13 12:57:52,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:57:52, skipping insertion in model container [2024-10-13 12:57:52,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:52" (3/3) ... [2024-10-13 12:57:52,396 INFO L112 eAbstractionObserver]: Analyzing ICFG Mysore-2.c [2024-10-13 12:57:52,413 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:57:52,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 12:57:52,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:57:52,486 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;@47a2d4e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:57:52,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 12:57:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 19 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 12:57:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 12:57:52,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:52,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 12:57:52,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash 72255192, now seen corresponding path program 1 times [2024-10-13 12:57:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027768890] [2024-10-13 12:57:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:52,729 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 12:57:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027768890] [2024-10-13 12:57:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027768890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098072484] [2024-10-13 12:57:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:52,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:57:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:57:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:57:52,775 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 19 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 12:57:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:52,894 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-10-13 12:57:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:57:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-13 12:57:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:52,904 INFO L225 Difference]: With dead ends: 37 [2024-10-13 12:57:52,904 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 12:57:52,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:52,910 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:52,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 12:57:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-13 12:57:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 24 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 12:57:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-13 12:57:52,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2024-10-13 12:57:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:52,943 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 12:57:52,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 12:57:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-13 12:57:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:57:52,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:52,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:57:52,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:57:52,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:52,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:52,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2055056291, now seen corresponding path program 1 times [2024-10-13 12:57:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82284020] [2024-10-13 12:57:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:52,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,004 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 12:57:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82284020] [2024-10-13 12:57:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82284020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:53,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780443438] [2024-10-13 12:57:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:57:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:57:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:57:53,009 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 12:57:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,087 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-10-13 12:57:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:57:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 12:57:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,089 INFO L225 Difference]: With dead ends: 27 [2024-10-13 12:57:53,089 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 12:57:53,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:53,091 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 12:57:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-10-13 12:57:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 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 12:57:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 12:57:53,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 6 [2024-10-13 12:57:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,121 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 12:57:53,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 12:57:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-13 12:57:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 12:57:53,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:57:53,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 775862367, now seen corresponding path program 1 times [2024-10-13 12:57:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:53,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677715710] [2024-10-13 12:57:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,220 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 12:57:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677715710] [2024-10-13 12:57:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677715710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005056179] [2024-10-13 12:57:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:57:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:57:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:57:53,223 INFO L87 Difference]: Start difference. First operand 25 states and 29 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 12:57:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,288 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-10-13 12:57:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:57:53,288 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 12:57:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,289 INFO L225 Difference]: With dead ends: 26 [2024-10-13 12:57:53,289 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 12:57:53,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:53,291 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 12:57:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 12:57:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4736842105263157) 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 12:57:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-13 12:57:53,297 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 8 [2024-10-13 12:57:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,297 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-13 12:57:53,297 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 12:57:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-13 12:57:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 12:57:53,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:57:53,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1718070337, now seen corresponding path program 1 times [2024-10-13 12:57:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:53,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210023943] [2024-10-13 12:57:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,360 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 12:57:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210023943] [2024-10-13 12:57:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210023943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:53,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:53,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:57:53,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058913811] [2024-10-13 12:57:53,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:57:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:57:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:57:53,364 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 12:57:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,425 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-13 12:57:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:57:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-10-13 12:57:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,427 INFO L225 Difference]: With dead ends: 32 [2024-10-13 12:57:53,427 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 12:57:53,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:57:53,428 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 12:57:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-10-13 12:57:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 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 12:57:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-13 12:57:53,442 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2024-10-13 12:57:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,442 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-13 12:57:53,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 12:57:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-13 12:57:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:57:53,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:57:53,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:53,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1720572831, now seen corresponding path program 1 times [2024-10-13 12:57:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:53,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513701256] [2024-10-13 12:57:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,504 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 12:57:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513701256] [2024-10-13 12:57:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513701256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:57:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424345894] [2024-10-13 12:57:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:57:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:57:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:53,506 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12:57:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,532 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-13 12:57:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:57:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-13 12:57:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,533 INFO L225 Difference]: With dead ends: 25 [2024-10-13 12:57:53,533 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 12:57:53,533 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 12:57:53,534 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 12:57:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-13 12:57:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 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 12:57:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-13 12:57:53,540 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 10 [2024-10-13 12:57:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,540 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-13 12:57:53,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12:57:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-13 12:57:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 12:57:53,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:57:53,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:53,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1798150143, now seen corresponding path program 1 times [2024-10-13 12:57:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011498440] [2024-10-13 12:57:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,582 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 12:57:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011498440] [2024-10-13 12:57:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011498440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:57:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:57:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657645032] [2024-10-13 12:57:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:57:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:57:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:57:53,588 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 12:57:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,617 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-10-13 12:57:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:57:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 12:57:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,618 INFO L225 Difference]: With dead ends: 25 [2024-10-13 12:57:53,618 INFO L226 Difference]: Without dead ends: 24 [2024-10-13 12:57:53,619 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 12:57:53,620 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-13 12:57:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-13 12:57:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 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 12:57:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-10-13 12:57:53,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2024-10-13 12:57:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,626 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-10-13 12:57:53,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 12:57:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-10-13 12:57:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:57:53,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,627 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:57:53,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:53,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1445432797, now seen corresponding path program 1 times [2024-10-13 12:57:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:53,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130371609] [2024-10-13 12:57:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130371609] [2024-10-13 12:57:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130371609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312978192] [2024-10-13 12:57:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:53,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:53,695 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 12:57:53,696 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 12:57:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:53,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:57:53,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:53,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312978192] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:53,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-13 12:57:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253708247] [2024-10-13 12:57:53,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:53,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:57:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:57:53,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:57:53,861 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 12:57:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:53,960 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-13 12:57:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:57:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 13 [2024-10-13 12:57:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:53,962 INFO L225 Difference]: With dead ends: 33 [2024-10-13 12:57:53,962 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:57:53,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:57:53,964 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:53,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:57:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 12:57:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 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 12:57:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-13 12:57:53,977 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2024-10-13 12:57:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-13 12:57:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 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 12:57:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-13 12:57:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:57:53,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:53,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:53,998 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 12:57:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:54,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1786479451, now seen corresponding path program 1 times [2024-10-13 12:57:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037676895] [2024-10-13 12:57:54,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037676895] [2024-10-13 12:57:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037676895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162355470] [2024-10-13 12:57:54,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:54,271 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 12:57:54,283 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 12:57:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:54,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:57:54,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:54,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162355470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:54,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2024-10-13 12:57:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684930343] [2024-10-13 12:57:54,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:57:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:57:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:57:54,513 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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 12:57:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:54,648 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-13 12:57:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:57:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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 15 [2024-10-13 12:57:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:54,650 INFO L225 Difference]: With dead ends: 37 [2024-10-13 12:57:54,650 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 12:57:54,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:57:54,651 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:54,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 12:57:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-13 12:57:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 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 12:57:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-13 12:57:54,661 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2024-10-13 12:57:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:54,661 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-13 12:57:54,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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 12:57:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-13 12:57:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 12:57:54,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:54,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:57:54,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:57:54,866 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,SelfDestructingSolverStorable7 [2024-10-13 12:57:54,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 453711929, now seen corresponding path program 1 times [2024-10-13 12:57:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564213207] [2024-10-13 12:57:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:54,929 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 12:57:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564213207] [2024-10-13 12:57:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564213207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078157201] [2024-10-13 12:57:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:54,933 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 12:57:54,935 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 12:57:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:54,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:57:54,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:55,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:57:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078157201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:57:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:57:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-13 12:57:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766445854] [2024-10-13 12:57:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:57:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:57:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:57:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:57:55,060 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 12:57:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:55,121 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-13 12:57:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:57:55,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-10-13 12:57:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:55,122 INFO L225 Difference]: With dead ends: 34 [2024-10-13 12:57:55,122 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 12:57:55,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:57:55,123 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:55,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:57:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 12:57:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 12:57:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 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 12:57:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-13 12:57:55,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 16 [2024-10-13 12:57:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:55,127 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-13 12:57:55,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 12:57:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-13 12:57:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:57:55,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:55,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 12:57:55,141 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 12:57:55,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:55,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 270059928, now seen corresponding path program 1 times [2024-10-13 12:57:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094077524] [2024-10-13 12:57:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094077524] [2024-10-13 12:57:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094077524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654583357] [2024-10-13 12:57:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:55,473 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 12:57:55,473 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 12:57:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:55,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:57:55,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:55,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654583357] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:55,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-10-13 12:57:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175648206] [2024-10-13 12:57:55,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:55,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 12:57:55,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 12:57:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:57:55,689 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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 12:57:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:55,868 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-13 12:57:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:57:55,868 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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 19 [2024-10-13 12:57:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:55,869 INFO L225 Difference]: With dead ends: 33 [2024-10-13 12:57:55,869 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 12:57:55,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:57:55,870 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:55,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 12:57:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 12:57:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 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 12:57:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-10-13 12:57:55,875 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2024-10-13 12:57:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:55,875 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-10-13 12:57:55,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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 12:57:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-10-13 12:57:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 12:57:55,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:55,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2024-10-13 12:57:55,892 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 12:57:56,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:56,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash 688888513, now seen corresponding path program 1 times [2024-10-13 12:57:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391078519] [2024-10-13 12:57:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391078519] [2024-10-13 12:57:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391078519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393751078] [2024-10-13 12:57:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:56,164 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 12:57:56,165 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 12:57:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:56,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:57:56,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:56,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393751078] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:56,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-10-13 12:57:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749343329] [2024-10-13 12:57:56,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:57:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:57:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:57:56,314 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 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 12:57:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:56,465 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2024-10-13 12:57:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:57:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 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 25 [2024-10-13 12:57:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:56,467 INFO L225 Difference]: With dead ends: 64 [2024-10-13 12:57:56,467 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 12:57:56,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:57:56,469 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:56,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 12:57:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 12:57:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 62 states have internal predecessors, (71), 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 12:57:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-10-13 12:57:56,476 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 25 [2024-10-13 12:57:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:56,476 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-10-13 12:57:56,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 14 states have internal predecessors, (72), 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 12:57:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-10-13 12:57:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 12:57:56,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:56,477 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-10-13 12:57:56,493 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 12:57:56,677 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,SelfDestructingSolverStorable10 [2024-10-13 12:57:56,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:56,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 596899043, now seen corresponding path program 2 times [2024-10-13 12:57:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881533644] [2024-10-13 12:57:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881533644] [2024-10-13 12:57:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881533644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339891682] [2024-10-13 12:57:56,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:57:56,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:56,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:56,782 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 12:57:56,784 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 12:57:56,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:57:56,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:57:56,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:57:56,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:56,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339891682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:57,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-13 12:57:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609439634] [2024-10-13 12:57:57,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 12:57:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 12:57:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:57:57,029 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 12:57:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:57,191 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-10-13 12:57:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:57:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 27 [2024-10-13 12:57:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:57,192 INFO L225 Difference]: With dead ends: 63 [2024-10-13 12:57:57,192 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 12:57:57,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:57:57,193 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:57,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:57:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 12:57:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-13 12:57:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 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 12:57:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-13 12:57:57,201 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2024-10-13 12:57:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:57,201 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-13 12:57:57,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 12:57:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-13 12:57:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 12:57:57,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:57,202 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2024-10-13 12:57:57,218 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 12:57:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:57,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1905635483, now seen corresponding path program 2 times [2024-10-13 12:57:57,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:57,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255574347] [2024-10-13 12:57:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:57,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:57,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255574347] [2024-10-13 12:57:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255574347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940832962] [2024-10-13 12:57:57,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:57:57,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:57,525 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 12:57:57,527 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 12:57:57,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:57:57,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:57:57,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:57:57,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:57,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940832962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:57,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-10-13 12:57:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502586473] [2024-10-13 12:57:57,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:57:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:57:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:57:57,931 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 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 12:57:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:57:58,492 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-10-13 12:57:58,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 12:57:58,493 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 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 29 [2024-10-13 12:57:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:57:58,494 INFO L225 Difference]: With dead ends: 68 [2024-10-13 12:57:58,494 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 12:57:58,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=620, Invalid=1542, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 12:57:58,495 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:57:58,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 6 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 12:57:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 12:57:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-13 12:57:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.03125) internal successors, (66), 65 states have internal predecessors, (66), 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 12:57:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2024-10-13 12:57:58,501 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 29 [2024-10-13 12:57:58,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:57:58,502 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2024-10-13 12:57:58,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 26 states have internal predecessors, (85), 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 12:57:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2024-10-13 12:57:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:57:58,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:57:58,503 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1] [2024-10-13 12:57:58,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:57:58,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:58,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:57:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:57:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1327498683, now seen corresponding path program 2 times [2024-10-13 12:57:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:57:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465128288] [2024-10-13 12:57:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:57:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:57:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:57:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:59,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:57:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465128288] [2024-10-13 12:57:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465128288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:57:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907370937] [2024-10-13 12:57:59,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:57:59,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:57:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:57:59,035 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 12:57:59,036 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 12:57:59,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:57:59,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:57:59,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:57:59,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:57:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:59,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:57:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:57:59,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907370937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:57:59,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:57:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-10-13 12:57:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111450621] [2024-10-13 12:57:59,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:57:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 12:57:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:57:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 12:57:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 12:57:59,780 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 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 12:58:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:58:00,765 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2024-10-13 12:58:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 12:58:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 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 60 [2024-10-13 12:58:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:58:00,766 INFO L225 Difference]: With dead ends: 74 [2024-10-13 12:58:00,766 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 12:58:00,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=970, Invalid=2690, Unknown=0, NotChecked=0, Total=3660 [2024-10-13 12:58:00,769 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:58:00,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 12:58:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 12:58:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-10-13 12:58:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 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 12:58:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2024-10-13 12:58:00,780 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2024-10-13 12:58:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:58:00,781 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2024-10-13 12:58:00,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.606060606060606) internal successors, (119), 34 states have internal predecessors, (119), 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 12:58:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2024-10-13 12:58:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:58:00,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:58:00,782 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2024-10-13 12:58:00,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 12:58:00,983 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,SelfDestructingSolverStorable13 [2024-10-13 12:58:00,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 12:58:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:58:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash 267955551, now seen corresponding path program 3 times [2024-10-13 12:58:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:58:00,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415348052] [2024-10-13 12:58:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:58:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:58:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:58:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:58:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:58:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415348052] [2024-10-13 12:58:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415348052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:58:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483466726] [2024-10-13 12:58:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:58:01,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:58:01,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:58:01,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:58:01,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 12:58:01,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 12:58:01,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:58:01,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:58:01,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:58:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 12:58:01,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:58:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 121 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 12:58:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483466726] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:58:01,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:58:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 35 [2024-10-13 12:58:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993262089] [2024-10-13 12:58:01,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:58:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 12:58:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:58:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 12:58:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2024-10-13 12:58:01,914 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 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 12:58:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:58:03,366 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2024-10-13 12:58:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-13 12:58:03,367 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 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 64 [2024-10-13 12:58:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:58:03,367 INFO L225 Difference]: With dead ends: 75 [2024-10-13 12:58:03,367 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:58:03,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1061, Invalid=4341, Unknown=0, NotChecked=0, Total=5402 [2024-10-13 12:58:03,370 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:58:03,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 2 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 12:58:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:58:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:58:03,371 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 12:58:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:58:03,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-10-13 12:58:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:58:03,371 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:58:03,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 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 12:58:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:58:03,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:58:03,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 12:58:03,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 12:58:03,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 12:58:03,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 12:58:03,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 12:58:03,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 12:58:03,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 12:58:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 12:58:03,578 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:58:03,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:58:03,812 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:58:03,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:58:03 BoogieIcfgContainer [2024-10-13 12:58:03,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:58:03,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:58:03,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:58:03,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:58:03,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:57:52" (3/4) ... [2024-10-13 12:58:03,837 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:58:03,843 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 12:58:03,844 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:58:03,844 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 12:58:03,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:58:03,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:58:03,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:58:03,931 INFO L158 Benchmark]: Toolchain (without parser) took 12118.18ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 99.3MB in the beginning and 98.9MB in the end (delta: 333.7kB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,931 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:58:03,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.26ms. Allocated memory is still 157.3MB. Free memory was 98.7MB in the beginning and 87.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.63ms. Allocated memory is still 157.3MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,933 INFO L158 Benchmark]: Boogie Preprocessor took 22.51ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 85.2MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:58:03,933 INFO L158 Benchmark]: RCFGBuilder took 295.16ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 74.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,933 INFO L158 Benchmark]: TraceAbstraction took 11444.15ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 73.5MB in the beginning and 103.1MB in the end (delta: -29.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,933 INFO L158 Benchmark]: Witness Printer took 96.41ms. Allocated memory is still 224.4MB. Free memory was 103.1MB in the beginning and 98.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:58:03,935 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.19ms. Allocated memory is still 157.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.26ms. Allocated memory is still 157.3MB. Free memory was 98.7MB in the beginning and 87.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.63ms. Allocated memory is still 157.3MB. Free memory was 87.6MB in the beginning and 86.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.51ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 85.2MB in the end (delta: 925.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.16ms. Allocated memory is still 157.3MB. Free memory was 84.6MB in the beginning and 74.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11444.15ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 73.5MB in the beginning and 103.1MB in the end (delta: -29.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 96.41ms. Allocated memory is still 224.4MB. Free memory was 103.1MB in the beginning and 98.9MB 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: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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, 20 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 15, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2854 IncrementalHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 58 mSDtfsCounter, 2854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=13, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 585 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 4120 SizeOfPredicates, 10 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 412/1570 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 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((0 <= (2147483649 + x)) && (((long) c + x) <= 65531)) && (3 <= c)) && ((x + ((long) c * 4)) <= 2147483656)) || ((((3 <= c) && (c <= 65536)) && (0 <= (((long) c + x) + 65535))) && (((long) c + x) <= 65536))) || ((((2 <= c) && (c <= 65535)) && (0 <= ((long) x + 65535))) && (x <= 65535))) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:58:03,967 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