./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 11:14:06,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 11:14:07,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 11:14:07,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 11:14:07,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 11:14:07,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 11:14:07,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 11:14:07,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 11:14:07,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 11:14:07,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 11:14:07,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 11:14:07,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 11:14:07,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 11:14:07,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 11:14:07,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 11:14:07,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 11:14:07,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 11:14:07,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 11:14:07,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 11:14:07,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 11:14:07,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 11:14:07,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 11:14:07,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 11:14:07,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 11:14:07,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 11:14:07,046 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 11:14:07,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 11:14:07,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 11:14:07,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 11:14:07,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 11:14:07,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 11:14:07,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 11:14:07,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 11:14:07,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 11:14:07,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:14:07,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 11:14:07,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 11:14:07,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 11:14:07,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 11:14:07,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 11:14:07,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 11:14:07,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 11:14:07,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 11:14:07,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 11:14:07,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2024-11-19 11:14:07,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 11:14:07,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 11:14:07,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 11:14:07,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 11:14:07,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 11:14:07,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-19 11:14:08,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 11:14:09,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 11:14:09,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-19 11:14:09,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d548464/56ca07881e384e9db491cec9ecf2405b/FLAG6d3acfc02 [2024-11-19 11:14:09,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d548464/56ca07881e384e9db491cec9ecf2405b [2024-11-19 11:14:09,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 11:14:09,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 11:14:09,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 11:14:09,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 11:14:09,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 11:14:09,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e668aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09, skipping insertion in model container [2024-11-19 11:14:09,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 11:14:09,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:14:09,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 11:14:09,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 11:14:09,459 INFO L204 MainTranslator]: Completed translation [2024-11-19 11:14:09,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09 WrapperNode [2024-11-19 11:14:09,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 11:14:09,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 11:14:09,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 11:14:09,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 11:14:09,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,510 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 271 [2024-11-19 11:14:09,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 11:14:09,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 11:14:09,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 11:14:09,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 11:14:09,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 11:14:09,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 11:14:09,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 11:14:09,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 11:14:09,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 11:14:09,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (1/1) ... [2024-11-19 11:14:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 11:14:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:09,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 11:14:09,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 11:14:09,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 11:14:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-19 11:14:09,641 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-19 11:14:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 11:14:09,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 11:14:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 11:14:09,641 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 11:14:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 11:14:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 11:14:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 11:14:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 11:14:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 11:14:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 11:14:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 11:14:09,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 11:14:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 11:14:09,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 11:14:09,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 11:14:10,070 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-19 11:14:10,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 11:14:10,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 11:14:10,085 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 11:14:10,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:14:10 BoogieIcfgContainer [2024-11-19 11:14:10,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 11:14:10,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 11:14:10,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 11:14:10,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 11:14:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:14:09" (1/3) ... [2024-11-19 11:14:10,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d05745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:14:10, skipping insertion in model container [2024-11-19 11:14:10,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:14:09" (2/3) ... [2024-11-19 11:14:10,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d05745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:14:10, skipping insertion in model container [2024-11-19 11:14:10,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:14:10" (3/3) ... [2024-11-19 11:14:10,096 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-19 11:14:10,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 11:14:10,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 11:14:10,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 11:14:10,172 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;@1a86626d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 11:14:10,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 11:14:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 104 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 11:14:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 11:14:10,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:10,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:10,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:10,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1980410107, now seen corresponding path program 1 times [2024-11-19 11:14:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949766251] [2024-11-19 11:14:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949766251] [2024-11-19 11:14:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949766251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:10,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:14:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062036553] [2024-11-19 11:14:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:10,530 INFO L87 Difference]: Start difference. First operand has 123 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 104 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:10,724 INFO L93 Difference]: Finished difference Result 338 states and 479 transitions. [2024-11-19 11:14:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-19 11:14:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:10,736 INFO L225 Difference]: With dead ends: 338 [2024-11-19 11:14:10,736 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 11:14:10,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:10,745 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 269 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:10,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 524 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 11:14:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 195. [2024-11-19 11:14:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 165 states have internal predecessors, (223), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 11:14:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2024-11-19 11:14:10,807 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 48 [2024-11-19 11:14:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:10,808 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2024-11-19 11:14:10,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2024-11-19 11:14:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 11:14:10,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:10,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 11:14:10,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash 737999430, now seen corresponding path program 1 times [2024-11-19 11:14:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354909777] [2024-11-19 11:14:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:10,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354909777] [2024-11-19 11:14:10,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354909777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:10,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:14:10,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586536892] [2024-11-19 11:14:10,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:10,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:10,952 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:10,989 INFO L93 Difference]: Finished difference Result 383 states and 520 transitions. [2024-11-19 11:14:10,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:14:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-19 11:14:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:10,992 INFO L225 Difference]: With dead ends: 383 [2024-11-19 11:14:10,992 INFO L226 Difference]: Without dead ends: 198 [2024-11-19 11:14:10,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:10,995 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:10,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-19 11:14:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-19 11:14:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.40625) internal successors, (225), 168 states have internal predecessors, (225), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-19 11:14:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 265 transitions. [2024-11-19 11:14:11,017 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 265 transitions. Word has length 48 [2024-11-19 11:14:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:11,018 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 265 transitions. [2024-11-19 11:14:11,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 265 transitions. [2024-11-19 11:14:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 11:14:11,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:11,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 11:14:11,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2124202824, now seen corresponding path program 1 times [2024-11-19 11:14:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:11,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905189811] [2024-11-19 11:14:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:11,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905189811] [2024-11-19 11:14:11,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905189811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:11,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:14:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059703767] [2024-11-19 11:14:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:11,136 INFO L87 Difference]: Start difference. First operand 198 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:11,473 INFO L93 Difference]: Finished difference Result 818 states and 1079 transitions. [2024-11-19 11:14:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:14:11,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-19 11:14:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:11,480 INFO L225 Difference]: With dead ends: 818 [2024-11-19 11:14:11,480 INFO L226 Difference]: Without dead ends: 602 [2024-11-19 11:14:11,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:11,484 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 610 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:11,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 606 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:14:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-19 11:14:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 430. [2024-11-19 11:14:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.3949579831932772) internal successors, (498), 364 states have internal predecessors, (498), 41 states have call successors, (41), 23 states have call predecessors, (41), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2024-11-19 11:14:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 582 transitions. [2024-11-19 11:14:11,530 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 582 transitions. Word has length 48 [2024-11-19 11:14:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:11,530 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 582 transitions. [2024-11-19 11:14:11,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 582 transitions. [2024-11-19 11:14:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 11:14:11,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:11,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:11,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 11:14:11,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 349081956, now seen corresponding path program 1 times [2024-11-19 11:14:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461935272] [2024-11-19 11:14:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:11,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:11,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461935272] [2024-11-19 11:14:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461935272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:14:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086747214] [2024-11-19 11:14:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:11,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:11,594 INFO L87 Difference]: Start difference. First operand 430 states and 582 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:11,729 INFO L93 Difference]: Finished difference Result 1125 states and 1512 transitions. [2024-11-19 11:14:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-19 11:14:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:11,734 INFO L225 Difference]: With dead ends: 1125 [2024-11-19 11:14:11,734 INFO L226 Difference]: Without dead ends: 705 [2024-11-19 11:14:11,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:11,736 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 242 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:11,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 643 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-19 11:14:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 559. [2024-11-19 11:14:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 456 states have (on average 1.3179824561403508) internal successors, (601), 464 states have internal predecessors, (601), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2024-11-19 11:14:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 725 transitions. [2024-11-19 11:14:11,781 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 725 transitions. Word has length 50 [2024-11-19 11:14:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 725 transitions. [2024-11-19 11:14:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 725 transitions. [2024-11-19 11:14:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 11:14:11,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:11,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 11:14:11,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 40642947, now seen corresponding path program 1 times [2024-11-19 11:14:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401396719] [2024-11-19 11:14:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401396719] [2024-11-19 11:14:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401396719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:14:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462755855] [2024-11-19 11:14:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:11,850 INFO L87 Difference]: Start difference. First operand 559 states and 725 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:11,927 INFO L93 Difference]: Finished difference Result 1120 states and 1470 transitions. [2024-11-19 11:14:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:14:11,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-19 11:14:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:11,932 INFO L225 Difference]: With dead ends: 1120 [2024-11-19 11:14:11,933 INFO L226 Difference]: Without dead ends: 571 [2024-11-19 11:14:11,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:11,936 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:11,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-19 11:14:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2024-11-19 11:14:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 468 states have (on average 1.3034188034188035) internal successors, (610), 476 states have internal predecessors, (610), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2024-11-19 11:14:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 734 transitions. [2024-11-19 11:14:11,984 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 734 transitions. Word has length 50 [2024-11-19 11:14:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:11,984 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 734 transitions. [2024-11-19 11:14:11,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 734 transitions. [2024-11-19 11:14:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 11:14:11,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:11,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:11,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 11:14:11,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -93370559, now seen corresponding path program 1 times [2024-11-19 11:14:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811724797] [2024-11-19 11:14:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811724797] [2024-11-19 11:14:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811724797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:14:12,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779421532] [2024-11-19 11:14:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:12,059 INFO L87 Difference]: Start difference. First operand 571 states and 734 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:12,220 INFO L93 Difference]: Finished difference Result 1666 states and 2172 transitions. [2024-11-19 11:14:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:14:12,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-19 11:14:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:12,227 INFO L225 Difference]: With dead ends: 1666 [2024-11-19 11:14:12,227 INFO L226 Difference]: Without dead ends: 1106 [2024-11-19 11:14:12,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-19 11:14:12,230 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 158 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:12,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 338 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-19 11:14:12,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1100. [2024-11-19 11:14:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 900 states have (on average 1.2722222222222221) internal successors, (1145), 912 states have internal predecessors, (1145), 119 states have call successors, (119), 70 states have call predecessors, (119), 73 states have return successors, (156), 119 states have call predecessors, (156), 119 states have call successors, (156) [2024-11-19 11:14:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1420 transitions. [2024-11-19 11:14:12,339 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1420 transitions. Word has length 50 [2024-11-19 11:14:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:12,340 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1420 transitions. [2024-11-19 11:14:12,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 11:14:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1420 transitions. [2024-11-19 11:14:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 11:14:12,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:12,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:12,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 11:14:12,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 229733577, now seen corresponding path program 1 times [2024-11-19 11:14:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115257062] [2024-11-19 11:14:12,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115257062] [2024-11-19 11:14:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115257062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:14:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296190928] [2024-11-19 11:14:12,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:12,400 INFO L87 Difference]: Start difference. First operand 1100 states and 1420 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:12,550 INFO L93 Difference]: Finished difference Result 2696 states and 3486 transitions. [2024-11-19 11:14:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2024-11-19 11:14:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:12,559 INFO L225 Difference]: With dead ends: 2696 [2024-11-19 11:14:12,559 INFO L226 Difference]: Without dead ends: 1740 [2024-11-19 11:14:12,562 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-11-19 11:14:12,563 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:12,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 264 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2024-11-19 11:14:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1740. [2024-11-19 11:14:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1433 states have (on average 1.2595952547103977) internal successors, (1805), 1448 states have internal predecessors, (1805), 183 states have call successors, (183), 110 states have call predecessors, (183), 116 states have return successors, (244), 183 states have call predecessors, (244), 183 states have call successors, (244) [2024-11-19 11:14:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2232 transitions. [2024-11-19 11:14:12,674 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2232 transitions. Word has length 51 [2024-11-19 11:14:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:12,674 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2232 transitions. [2024-11-19 11:14:12,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2232 transitions. [2024-11-19 11:14:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 11:14:12,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:12,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:12,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 11:14:12,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:12,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1971660673, now seen corresponding path program 1 times [2024-11-19 11:14:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341891896] [2024-11-19 11:14:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341891896] [2024-11-19 11:14:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341891896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:12,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:12,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:14:12,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904076154] [2024-11-19 11:14:12,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:12,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:12,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:12,744 INFO L87 Difference]: Start difference. First operand 1740 states and 2232 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:12,856 INFO L93 Difference]: Finished difference Result 1938 states and 2481 transitions. [2024-11-19 11:14:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:12,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2024-11-19 11:14:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:12,867 INFO L225 Difference]: With dead ends: 1938 [2024-11-19 11:14:12,867 INFO L226 Difference]: Without dead ends: 1934 [2024-11-19 11:14:12,868 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-11-19 11:14:12,870 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 106 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:12,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 287 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-19 11:14:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1930. [2024-11-19 11:14:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1596 states have (on average 1.256265664160401) internal successors, (2005), 1612 states have internal predecessors, (2005), 199 states have call successors, (199), 120 states have call predecessors, (199), 127 states have return successors, (265), 199 states have call predecessors, (265), 199 states have call successors, (265) [2024-11-19 11:14:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2469 transitions. [2024-11-19 11:14:12,977 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2469 transitions. Word has length 51 [2024-11-19 11:14:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:12,978 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2469 transitions. [2024-11-19 11:14:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2469 transitions. [2024-11-19 11:14:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 11:14:12,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:12,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:12,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 11:14:12,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash 395990028, now seen corresponding path program 1 times [2024-11-19 11:14:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:12,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023483557] [2024-11-19 11:14:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023483557] [2024-11-19 11:14:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023483557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:14:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798481760] [2024-11-19 11:14:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:13,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:13,067 INFO L87 Difference]: Start difference. First operand 1930 states and 2469 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:13,253 INFO L93 Difference]: Finished difference Result 3120 states and 3999 transitions. [2024-11-19 11:14:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:13,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-11-19 11:14:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:13,264 INFO L225 Difference]: With dead ends: 3120 [2024-11-19 11:14:13,264 INFO L226 Difference]: Without dead ends: 2100 [2024-11-19 11:14:13,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:13,269 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 208 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:13,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 459 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-19 11:14:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2024-11-19 11:14:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 1737 states have (on average 1.2504317789291883) internal successors, (2172), 1754 states have internal predecessors, (2172), 215 states have call successors, (215), 130 states have call predecessors, (215), 138 states have return successors, (286), 215 states have call predecessors, (286), 215 states have call successors, (286) [2024-11-19 11:14:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2673 transitions. [2024-11-19 11:14:13,365 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2673 transitions. Word has length 59 [2024-11-19 11:14:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:13,366 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2673 transitions. [2024-11-19 11:14:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2673 transitions. [2024-11-19 11:14:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 11:14:13,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:13,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 11:14:13,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash -609210758, now seen corresponding path program 1 times [2024-11-19 11:14:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099370297] [2024-11-19 11:14:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 11:14:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099370297] [2024-11-19 11:14:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099370297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:14:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497559752] [2024-11-19 11:14:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:13,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:13,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:13,460 INFO L87 Difference]: Start difference. First operand 2098 states and 2673 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:13,621 INFO L93 Difference]: Finished difference Result 2958 states and 3767 transitions. [2024-11-19 11:14:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:13,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-19 11:14:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:13,634 INFO L225 Difference]: With dead ends: 2958 [2024-11-19 11:14:13,635 INFO L226 Difference]: Without dead ends: 2956 [2024-11-19 11:14:13,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:13,637 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 220 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:13,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 353 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2024-11-19 11:14:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2948. [2024-11-19 11:14:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2452 states have (on average 1.2471451876019577) internal successors, (3058), 2474 states have internal predecessors, (3058), 295 states have call successors, (295), 180 states have call predecessors, (295), 193 states have return successors, (397), 295 states have call predecessors, (397), 295 states have call successors, (397) [2024-11-19 11:14:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3750 transitions. [2024-11-19 11:14:13,833 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3750 transitions. Word has length 60 [2024-11-19 11:14:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:13,835 INFO L471 AbstractCegarLoop]: Abstraction has 2948 states and 3750 transitions. [2024-11-19 11:14:13,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 11:14:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3750 transitions. [2024-11-19 11:14:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 11:14:13,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:13,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:13,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 11:14:13,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:13,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1069966793, now seen corresponding path program 1 times [2024-11-19 11:14:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402798057] [2024-11-19 11:14:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 11:14:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402798057] [2024-11-19 11:14:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402798057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:13,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 11:14:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672563373] [2024-11-19 11:14:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:13,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:13,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:13,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:13,909 INFO L87 Difference]: Start difference. First operand 2948 states and 3750 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 11:14:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:14,300 INFO L93 Difference]: Finished difference Result 6792 states and 8757 transitions. [2024-11-19 11:14:14,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 11:14:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2024-11-19 11:14:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:14,321 INFO L225 Difference]: With dead ends: 6792 [2024-11-19 11:14:14,322 INFO L226 Difference]: Without dead ends: 3860 [2024-11-19 11:14:14,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:14,331 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 665 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:14,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 646 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:14:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3860 states. [2024-11-19 11:14:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3860 to 3726. [2024-11-19 11:14:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 3064 states have (on average 1.2203002610966058) internal successors, (3739), 3092 states have internal predecessors, (3739), 397 states have call successors, (397), 240 states have call predecessors, (397), 257 states have return successors, (571), 397 states have call predecessors, (571), 397 states have call successors, (571) [2024-11-19 11:14:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 4707 transitions. [2024-11-19 11:14:14,604 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 4707 transitions. Word has length 70 [2024-11-19 11:14:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 4707 transitions. [2024-11-19 11:14:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 11:14:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 4707 transitions. [2024-11-19 11:14:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 11:14:14,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:14,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:14,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 11:14:14,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1242824384, now seen corresponding path program 1 times [2024-11-19 11:14:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197798138] [2024-11-19 11:14:14,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 11:14:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197798138] [2024-11-19 11:14:14,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197798138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:14,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:14,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 11:14:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919198968] [2024-11-19 11:14:14,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:14:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:14:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:14:14,689 INFO L87 Difference]: Start difference. First operand 3726 states and 4707 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 11:14:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:15,222 INFO L93 Difference]: Finished difference Result 7574 states and 9542 transitions. [2024-11-19 11:14:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 11:14:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2024-11-19 11:14:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:15,240 INFO L225 Difference]: With dead ends: 7574 [2024-11-19 11:14:15,240 INFO L226 Difference]: Without dead ends: 3746 [2024-11-19 11:14:15,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:14:15,249 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 865 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:15,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 955 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 11:14:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-11-19 11:14:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3600. [2024-11-19 11:14:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 2967 states have (on average 1.2055948769801146) internal successors, (3577), 2994 states have internal predecessors, (3577), 378 states have call successors, (378), 230 states have call predecessors, (378), 247 states have return successors, (477), 378 states have call predecessors, (477), 378 states have call successors, (477) [2024-11-19 11:14:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4432 transitions. [2024-11-19 11:14:15,479 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4432 transitions. Word has length 82 [2024-11-19 11:14:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:15,479 INFO L471 AbstractCegarLoop]: Abstraction has 3600 states and 4432 transitions. [2024-11-19 11:14:15,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 11:14:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4432 transitions. [2024-11-19 11:14:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 11:14:15,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:15,486 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:15,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 11:14:15,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1450817259, now seen corresponding path program 1 times [2024-11-19 11:14:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:15,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714000793] [2024-11-19 11:14:15,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:15,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:14:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714000793] [2024-11-19 11:14:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714000793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606427641] [2024-11-19 11:14:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:15,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:15,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 11:14:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:15,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:14:15,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 11:14:15,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606427641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-19 11:14:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888986480] [2024-11-19 11:14:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:15,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:15,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:15,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:15,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:15,911 INFO L87 Difference]: Start difference. First operand 3600 states and 4432 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:16,016 INFO L93 Difference]: Finished difference Result 4859 states and 6024 transitions. [2024-11-19 11:14:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-19 11:14:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:16,027 INFO L225 Difference]: With dead ends: 4859 [2024-11-19 11:14:16,028 INFO L226 Difference]: Without dead ends: 1983 [2024-11-19 11:14:16,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:16,035 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:16,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-19 11:14:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1983. [2024-11-19 11:14:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1632 states have (on average 1.1924019607843137) internal successors, (1946), 1652 states have internal predecessors, (1946), 207 states have call successors, (207), 125 states have call predecessors, (207), 136 states have return successors, (253), 207 states have call predecessors, (253), 207 states have call successors, (253) [2024-11-19 11:14:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2406 transitions. [2024-11-19 11:14:16,157 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2406 transitions. Word has length 127 [2024-11-19 11:14:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 2406 transitions. [2024-11-19 11:14:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2406 transitions. [2024-11-19 11:14:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 11:14:16,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:16,162 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:16,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 11:14:16,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 11:14:16,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:16,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash 865439513, now seen corresponding path program 1 times [2024-11-19 11:14:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391344990] [2024-11-19 11:14:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-19 11:14:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391344990] [2024-11-19 11:14:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391344990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819727993] [2024-11-19 11:14:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:16,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:16,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 11:14:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:16,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:14:16,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 11:14:16,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819727993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-19 11:14:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091351077] [2024-11-19 11:14:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:16,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:16,738 INFO L87 Difference]: Start difference. First operand 1983 states and 2406 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:16,838 INFO L93 Difference]: Finished difference Result 4306 states and 5210 transitions. [2024-11-19 11:14:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:16,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2024-11-19 11:14:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:16,855 INFO L225 Difference]: With dead ends: 4306 [2024-11-19 11:14:16,856 INFO L226 Difference]: Without dead ends: 2537 [2024-11-19 11:14:16,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:16,861 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 59 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:16,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2024-11-19 11:14:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2532. [2024-11-19 11:14:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2073 states have (on average 1.1799324650265317) internal successors, (2446), 2093 states have internal predecessors, (2446), 270 states have call successors, (270), 170 states have call predecessors, (270), 181 states have return successors, (323), 270 states have call predecessors, (323), 270 states have call successors, (323) [2024-11-19 11:14:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3039 transitions. [2024-11-19 11:14:17,001 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3039 transitions. Word has length 141 [2024-11-19 11:14:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:17,002 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3039 transitions. [2024-11-19 11:14:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3039 transitions. [2024-11-19 11:14:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-19 11:14:17,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:17,006 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:17,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 11:14:17,206 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,SelfDestructingSolverStorable13 [2024-11-19 11:14:17,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash 814777144, now seen corresponding path program 1 times [2024-11-19 11:14:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:17,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059261123] [2024-11-19 11:14:17,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-19 11:14:17,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:17,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059261123] [2024-11-19 11:14:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059261123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:14:17,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759443261] [2024-11-19 11:14:17,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:17,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:17,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:17,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:17,283 INFO L87 Difference]: Start difference. First operand 2532 states and 3039 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:17,438 INFO L93 Difference]: Finished difference Result 3723 states and 4496 transitions. [2024-11-19 11:14:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 149 [2024-11-19 11:14:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:17,453 INFO L225 Difference]: With dead ends: 3723 [2024-11-19 11:14:17,453 INFO L226 Difference]: Without dead ends: 2400 [2024-11-19 11:14:17,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:17,460 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 189 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:17,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 437 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2024-11-19 11:14:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2400. [2024-11-19 11:14:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1965 states have (on average 1.1786259541984734) internal successors, (2316), 1985 states have internal predecessors, (2316), 256 states have call successors, (256), 160 states have call predecessors, (256), 171 states have return successors, (305), 256 states have call predecessors, (305), 256 states have call successors, (305) [2024-11-19 11:14:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 2877 transitions. [2024-11-19 11:14:17,589 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 2877 transitions. Word has length 149 [2024-11-19 11:14:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:17,590 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 2877 transitions. [2024-11-19 11:14:17,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2877 transitions. [2024-11-19 11:14:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 11:14:17,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:17,594 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:17,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 11:14:17,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2052588499, now seen corresponding path program 1 times [2024-11-19 11:14:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:17,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107957910] [2024-11-19 11:14:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 11:14:17,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107957910] [2024-11-19 11:14:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107957910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059869978] [2024-11-19 11:14:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:17,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:17,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:17,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:17,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 11:14:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:17,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:14:17,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 11:14:17,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059869978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:17,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 11:14:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173928497] [2024-11-19 11:14:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:17,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:17,882 INFO L87 Difference]: Start difference. First operand 2400 states and 2877 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:14:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:18,039 INFO L93 Difference]: Finished difference Result 5571 states and 6692 transitions. [2024-11-19 11:14:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 164 [2024-11-19 11:14:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:18,059 INFO L225 Difference]: With dead ends: 5571 [2024-11-19 11:14:18,062 INFO L226 Difference]: Without dead ends: 3603 [2024-11-19 11:14:18,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 11:14:18,070 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:18,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 385 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2024-11-19 11:14:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3595. [2024-11-19 11:14:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 2970 states have (on average 1.164983164983165) internal successors, (3460), 3001 states have internal predecessors, (3460), 354 states have call successors, (354), 241 states have call predecessors, (354), 263 states have return successors, (434), 354 states have call predecessors, (434), 354 states have call successors, (434) [2024-11-19 11:14:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4248 transitions. [2024-11-19 11:14:18,322 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4248 transitions. Word has length 164 [2024-11-19 11:14:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:18,323 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 4248 transitions. [2024-11-19 11:14:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 11:14:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4248 transitions. [2024-11-19 11:14:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-19 11:14:18,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:18,329 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:18,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 11:14:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:18,531 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:18,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1155195221, now seen corresponding path program 1 times [2024-11-19 11:14:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:18,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649377219] [2024-11-19 11:14:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 11:14:18,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:18,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649377219] [2024-11-19 11:14:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649377219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001625234] [2024-11-19 11:14:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:18,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:18,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 11:14:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:18,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:14:18,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 11:14:18,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001625234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:18,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-19 11:14:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662359956] [2024-11-19 11:14:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:18,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 11:14:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 11:14:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:14:18,865 INFO L87 Difference]: Start difference. First operand 3595 states and 4248 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 11:14:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:18,968 INFO L93 Difference]: Finished difference Result 5932 states and 7037 transitions. [2024-11-19 11:14:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:14:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2024-11-19 11:14:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:18,980 INFO L225 Difference]: With dead ends: 5932 [2024-11-19 11:14:18,980 INFO L226 Difference]: Without dead ends: 2352 [2024-11-19 11:14:18,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 11:14:18,988 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:18,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 696 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2024-11-19 11:14:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2024-11-19 11:14:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1987 states have (on average 1.170608958228485) internal successors, (2326), 1994 states have internal predecessors, (2326), 206 states have call successors, (206), 135 states have call predecessors, (206), 151 states have return successors, (256), 222 states have call predecessors, (256), 206 states have call successors, (256) [2024-11-19 11:14:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2788 transitions. [2024-11-19 11:14:19,122 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2788 transitions. Word has length 164 [2024-11-19 11:14:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:19,123 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 2788 transitions. [2024-11-19 11:14:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 11:14:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2788 transitions. [2024-11-19 11:14:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 11:14:19,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:19,126 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:19,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 11:14:19,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 11:14:19,331 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:19,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1275895055, now seen corresponding path program 1 times [2024-11-19 11:14:19,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:19,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869505194] [2024-11-19 11:14:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:19,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869505194] [2024-11-19 11:14:19,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869505194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:19,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:19,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 11:14:19,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443695595] [2024-11-19 11:14:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:19,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:19,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:19,395 INFO L87 Difference]: Start difference. First operand 2352 states and 2788 transitions. Second operand has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:19,476 INFO L93 Difference]: Finished difference Result 2352 states and 2788 transitions. [2024-11-19 11:14:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 169 [2024-11-19 11:14:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:19,489 INFO L225 Difference]: With dead ends: 2352 [2024-11-19 11:14:19,490 INFO L226 Difference]: Without dead ends: 2350 [2024-11-19 11:14:19,491 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-11-19 11:14:19,491 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:19,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 131 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2024-11-19 11:14:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2024-11-19 11:14:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1987 states have (on average 1.1625566180171112) internal successors, (2310), 1992 states have internal predecessors, (2310), 206 states have call successors, (206), 135 states have call predecessors, (206), 151 states have return successors, (256), 222 states have call predecessors, (256), 206 states have call successors, (256) [2024-11-19 11:14:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2772 transitions. [2024-11-19 11:14:19,587 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2772 transitions. Word has length 169 [2024-11-19 11:14:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:19,587 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 2772 transitions. [2024-11-19 11:14:19,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2772 transitions. [2024-11-19 11:14:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-19 11:14:19,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:19,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:19,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 11:14:19,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1227816467, now seen corresponding path program 1 times [2024-11-19 11:14:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736412076] [2024-11-19 11:14:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:19,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736412076] [2024-11-19 11:14:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736412076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273774104] [2024-11-19 11:14:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:19,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:19,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:19,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 11:14:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:19,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:14:19,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 11:14:20,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:20,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273774104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:20,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:20,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 11:14:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576936057] [2024-11-19 11:14:20,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:20,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 11:14:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 11:14:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:20,003 INFO L87 Difference]: Start difference. First operand 2350 states and 2772 transitions. Second operand has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:20,160 INFO L93 Difference]: Finished difference Result 2351 states and 2772 transitions. [2024-11-19 11:14:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 11:14:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 170 [2024-11-19 11:14:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:20,174 INFO L225 Difference]: With dead ends: 2351 [2024-11-19 11:14:20,174 INFO L226 Difference]: Without dead ends: 2349 [2024-11-19 11:14:20,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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-11-19 11:14:20,176 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 102 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:20,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 322 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2024-11-19 11:14:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2348. [2024-11-19 11:14:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 1987 states have (on average 1.1565173628585808) internal successors, (2298), 1990 states have internal predecessors, (2298), 206 states have call successors, (206), 135 states have call predecessors, (206), 151 states have return successors, (256), 222 states have call predecessors, (256), 206 states have call successors, (256) [2024-11-19 11:14:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 2760 transitions. [2024-11-19 11:14:20,276 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 2760 transitions. Word has length 170 [2024-11-19 11:14:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:20,277 INFO L471 AbstractCegarLoop]: Abstraction has 2348 states and 2760 transitions. [2024-11-19 11:14:20,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2760 transitions. [2024-11-19 11:14:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-19 11:14:20,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:20,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:20,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 11:14:20,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:20,485 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 592395441, now seen corresponding path program 1 times [2024-11-19 11:14:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067110233] [2024-11-19 11:14:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067110233] [2024-11-19 11:14:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067110233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972612445] [2024-11-19 11:14:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:20,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:20,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:20,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:20,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 11:14:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:20,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:14:20,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 11:14:20,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:14:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:21,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972612445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:14:21,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:14:21,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-19 11:14:21,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345881556] [2024-11-19 11:14:21,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:14:21,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:14:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:14:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:21,058 INFO L87 Difference]: Start difference. First operand 2348 states and 2760 transitions. Second operand has 7 states, 6 states have (on average 42.166666666666664) internal successors, (253), 7 states have internal predecessors, (253), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2024-11-19 11:14:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:21,438 INFO L93 Difference]: Finished difference Result 7077 states and 8441 transitions. [2024-11-19 11:14:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:14:21,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 42.166666666666664) internal successors, (253), 7 states have internal predecessors, (253), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 171 [2024-11-19 11:14:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:21,465 INFO L225 Difference]: With dead ends: 7077 [2024-11-19 11:14:21,466 INFO L226 Difference]: Without dead ends: 7075 [2024-11-19 11:14:21,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:21,470 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 312 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:21,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 620 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2024-11-19 11:14:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 5604. [2024-11-19 11:14:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5604 states, 4811 states have (on average 1.1683641654541674) internal successors, (5621), 4810 states have internal predecessors, (5621), 460 states have call successors, (460), 291 states have call predecessors, (460), 329 states have return successors, (622), 502 states have call predecessors, (622), 460 states have call successors, (622) [2024-11-19 11:14:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 6703 transitions. [2024-11-19 11:14:21,783 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 6703 transitions. Word has length 171 [2024-11-19 11:14:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 5604 states and 6703 transitions. [2024-11-19 11:14:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 42.166666666666664) internal successors, (253), 7 states have internal predecessors, (253), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2024-11-19 11:14:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 6703 transitions. [2024-11-19 11:14:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-19 11:14:21,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:21,789 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:21,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 11:14:21,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:21,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash -206968297, now seen corresponding path program 1 times [2024-11-19 11:14:21,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102332969] [2024-11-19 11:14:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:21,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:22,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102332969] [2024-11-19 11:14:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102332969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:22,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:22,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 11:14:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881985223] [2024-11-19 11:14:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:22,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:22,181 INFO L87 Difference]: Start difference. First operand 5604 states and 6703 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:22,750 INFO L93 Difference]: Finished difference Result 14493 states and 17509 transitions. [2024-11-19 11:14:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 11:14:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 180 [2024-11-19 11:14:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:22,789 INFO L225 Difference]: With dead ends: 14493 [2024-11-19 11:14:22,790 INFO L226 Difference]: Without dead ends: 10793 [2024-11-19 11:14:22,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 11:14:22,803 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 234 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:22,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 448 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10793 states. [2024-11-19 11:14:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10793 to 7374. [2024-11-19 11:14:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7374 states, 6313 states have (on average 1.1667986694123238) internal successors, (7366), 6308 states have internal predecessors, (7366), 619 states have call successors, (619), 388 states have call predecessors, (619), 438 states have return successors, (853), 677 states have call predecessors, (853), 619 states have call successors, (853) [2024-11-19 11:14:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 8838 transitions. [2024-11-19 11:14:23,223 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 8838 transitions. Word has length 180 [2024-11-19 11:14:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:23,224 INFO L471 AbstractCegarLoop]: Abstraction has 7374 states and 8838 transitions. [2024-11-19 11:14:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 8838 transitions. [2024-11-19 11:14:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 11:14:23,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:23,228 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:23,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 11:14:23,228 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:23,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash -277180787, now seen corresponding path program 1 times [2024-11-19 11:14:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144061306] [2024-11-19 11:14:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 11:14:23,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144061306] [2024-11-19 11:14:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144061306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773921573] [2024-11-19 11:14:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:23,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:23,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 11:14:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:23,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 11:14:23,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 11:14:23,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773921573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:23,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-19 11:14:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513243615] [2024-11-19 11:14:23,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:23,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:14:23,588 INFO L87 Difference]: Start difference. First operand 7374 states and 8838 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:24,033 INFO L93 Difference]: Finished difference Result 16101 states and 19401 transitions. [2024-11-19 11:14:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:14:24,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 181 [2024-11-19 11:14:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:24,064 INFO L225 Difference]: With dead ends: 16101 [2024-11-19 11:14:24,064 INFO L226 Difference]: Without dead ends: 10124 [2024-11-19 11:14:24,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 11:14:24,080 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 205 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:24,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 539 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2024-11-19 11:14:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10043. [2024-11-19 11:14:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10043 states, 8610 states have (on average 1.1668989547038326) internal successors, (10047), 8599 states have internal predecessors, (10047), 840 states have call successors, (840), 521 states have call predecessors, (840), 589 states have return successors, (1182), 922 states have call predecessors, (1182), 840 states have call successors, (1182) [2024-11-19 11:14:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10043 states to 10043 states and 12069 transitions. [2024-11-19 11:14:24,583 INFO L78 Accepts]: Start accepts. Automaton has 10043 states and 12069 transitions. Word has length 181 [2024-11-19 11:14:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:24,584 INFO L471 AbstractCegarLoop]: Abstraction has 10043 states and 12069 transitions. [2024-11-19 11:14:24,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10043 states and 12069 transitions. [2024-11-19 11:14:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-19 11:14:24,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:24,590 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:24,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 11:14:24,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:24,795 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:24,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash -33185425, now seen corresponding path program 1 times [2024-11-19 11:14:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681768560] [2024-11-19 11:14:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 43 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-19 11:14:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681768560] [2024-11-19 11:14:24,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681768560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490336736] [2024-11-19 11:14:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:24,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:24,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 11:14:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:25,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:14:25,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 11:14:25,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490336736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:25,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 11:14:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398154866] [2024-11-19 11:14:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:25,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:25,093 INFO L87 Difference]: Start difference. First operand 10043 states and 12069 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 11:14:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:25,850 INFO L93 Difference]: Finished difference Result 25223 states and 30463 transitions. [2024-11-19 11:14:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 235 [2024-11-19 11:14:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:25,909 INFO L225 Difference]: With dead ends: 25223 [2024-11-19 11:14:25,909 INFO L226 Difference]: Without dead ends: 15497 [2024-11-19 11:14:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:25,937 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 64 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15497 states. [2024-11-19 11:14:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15497 to 15379. [2024-11-19 11:14:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15379 states, 13133 states have (on average 1.1599025355973502) internal successors, (15233), 13122 states have internal predecessors, (15233), 1328 states have call successors, (1328), 828 states have call predecessors, (1328), 914 states have return successors, (1814), 1428 states have call predecessors, (1814), 1328 states have call successors, (1814) [2024-11-19 11:14:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15379 states to 15379 states and 18375 transitions. [2024-11-19 11:14:26,828 INFO L78 Accepts]: Start accepts. Automaton has 15379 states and 18375 transitions. Word has length 235 [2024-11-19 11:14:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:26,829 INFO L471 AbstractCegarLoop]: Abstraction has 15379 states and 18375 transitions. [2024-11-19 11:14:26,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 11:14:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 15379 states and 18375 transitions. [2024-11-19 11:14:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-19 11:14:26,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:26,840 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:26,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 11:14:27,041 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,SelfDestructingSolverStorable22 [2024-11-19 11:14:27,043 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash -365828563, now seen corresponding path program 1 times [2024-11-19 11:14:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736758390] [2024-11-19 11:14:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 43 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-19 11:14:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736758390] [2024-11-19 11:14:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736758390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959711511] [2024-11-19 11:14:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:27,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:27,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 11:14:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:27,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:14:27,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-19 11:14:27,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:27,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959711511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:27,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:27,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 11:14:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126029813] [2024-11-19 11:14:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:27,272 INFO L87 Difference]: Start difference. First operand 15379 states and 18375 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-19 11:14:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:27,628 INFO L93 Difference]: Finished difference Result 22073 states and 26392 transitions. [2024-11-19 11:14:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:27,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 235 [2024-11-19 11:14:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:27,654 INFO L225 Difference]: With dead ends: 22073 [2024-11-19 11:14:27,655 INFO L226 Difference]: Without dead ends: 6957 [2024-11-19 11:14:27,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 11:14:27,677 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:27,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2024-11-19 11:14:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6709. [2024-11-19 11:14:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6709 states, 5741 states have (on average 1.1372583173663124) internal successors, (6529), 5744 states have internal predecessors, (6529), 543 states have call successors, (543), 362 states have call predecessors, (543), 421 states have return successors, (765), 602 states have call predecessors, (765), 543 states have call successors, (765) [2024-11-19 11:14:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6709 states to 6709 states and 7837 transitions. [2024-11-19 11:14:27,975 INFO L78 Accepts]: Start accepts. Automaton has 6709 states and 7837 transitions. Word has length 235 [2024-11-19 11:14:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 6709 states and 7837 transitions. [2024-11-19 11:14:27,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-19 11:14:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6709 states and 7837 transitions. [2024-11-19 11:14:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-19 11:14:27,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:27,982 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:28,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 11:14:28,182 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,SelfDestructingSolverStorable23 [2024-11-19 11:14:28,182 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1426093183, now seen corresponding path program 1 times [2024-11-19 11:14:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:28,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529587824] [2024-11-19 11:14:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-19 11:14:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529587824] [2024-11-19 11:14:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529587824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947966297] [2024-11-19 11:14:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:28,263 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:28,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 11:14:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:28,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:14:28,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-19 11:14:28,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:14:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 11:14:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947966297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:14:28,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:14:28,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-11-19 11:14:28,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664262813] [2024-11-19 11:14:28,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:14:28,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 11:14:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 11:14:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:28,771 INFO L87 Difference]: Start difference. First operand 6709 states and 7837 transitions. Second operand has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 5 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2024-11-19 11:14:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:29,420 INFO L93 Difference]: Finished difference Result 14252 states and 16619 transitions. [2024-11-19 11:14:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 11:14:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 5 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) Word has length 258 [2024-11-19 11:14:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:29,444 INFO L225 Difference]: With dead ends: 14252 [2024-11-19 11:14:29,444 INFO L226 Difference]: Without dead ends: 7727 [2024-11-19 11:14:29,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-19 11:14:29,453 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 248 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:29,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 780 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 11:14:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2024-11-19 11:14:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 7649. [2024-11-19 11:14:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6513 states have (on average 1.1137724550898203) internal successors, (7254), 6558 states have internal predecessors, (7254), 614 states have call successors, (614), 408 states have call predecessors, (614), 518 states have return successors, (766), 682 states have call predecessors, (766), 614 states have call successors, (766) [2024-11-19 11:14:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 8634 transitions. [2024-11-19 11:14:29,791 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 8634 transitions. Word has length 258 [2024-11-19 11:14:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 7649 states and 8634 transitions. [2024-11-19 11:14:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 5 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2024-11-19 11:14:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 8634 transitions. [2024-11-19 11:14:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-19 11:14:29,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:29,798 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:29,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 11:14:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 11:14:29,999 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 656183061, now seen corresponding path program 1 times [2024-11-19 11:14:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844888102] [2024-11-19 11:14:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-11-19 11:14:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844888102] [2024-11-19 11:14:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844888102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:30,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:14:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382043338] [2024-11-19 11:14:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:30,049 INFO L87 Difference]: Start difference. First operand 7649 states and 8634 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:30,390 INFO L93 Difference]: Finished difference Result 7906 states and 8913 transitions. [2024-11-19 11:14:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 260 [2024-11-19 11:14:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:30,416 INFO L225 Difference]: With dead ends: 7906 [2024-11-19 11:14:30,417 INFO L226 Difference]: Without dead ends: 7624 [2024-11-19 11:14:30,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:30,420 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:30,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2024-11-19 11:14:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 7624. [2024-11-19 11:14:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7624 states, 6494 states have (on average 1.1139513396981828) internal successors, (7234), 6539 states have internal predecessors, (7234), 611 states have call successors, (611), 405 states have call predecessors, (611), 515 states have return successors, (763), 679 states have call predecessors, (763), 611 states have call successors, (763) [2024-11-19 11:14:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7624 states to 7624 states and 8608 transitions. [2024-11-19 11:14:31,025 INFO L78 Accepts]: Start accepts. Automaton has 7624 states and 8608 transitions. Word has length 260 [2024-11-19 11:14:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:31,026 INFO L471 AbstractCegarLoop]: Abstraction has 7624 states and 8608 transitions. [2024-11-19 11:14:31,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 11:14:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7624 states and 8608 transitions. [2024-11-19 11:14:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-19 11:14:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:31,033 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 11:14:31,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1180723491, now seen corresponding path program 1 times [2024-11-19 11:14:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123859320] [2024-11-19 11:14:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-19 11:14:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123859320] [2024-11-19 11:14:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123859320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 11:14:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 11:14:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617522550] [2024-11-19 11:14:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:31,189 INFO L87 Difference]: Start difference. First operand 7624 states and 8608 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:31,691 INFO L93 Difference]: Finished difference Result 7625 states and 8608 transitions. [2024-11-19 11:14:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:31,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 265 [2024-11-19 11:14:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:31,720 INFO L225 Difference]: With dead ends: 7625 [2024-11-19 11:14:31,720 INFO L226 Difference]: Without dead ends: 7364 [2024-11-19 11:14:31,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 11:14:31,725 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 45 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:31,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 241 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7364 states. [2024-11-19 11:14:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7364 to 7364. [2024-11-19 11:14:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 6272 states have (on average 1.1149553571428572) internal successors, (6993), 6317 states have internal predecessors, (6993), 590 states have call successors, (590), 390 states have call predecessors, (590), 498 states have return successors, (740), 656 states have call predecessors, (740), 590 states have call successors, (740) [2024-11-19 11:14:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 8323 transitions. [2024-11-19 11:14:32,309 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 8323 transitions. Word has length 265 [2024-11-19 11:14:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 8323 transitions. [2024-11-19 11:14:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 11:14:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 8323 transitions. [2024-11-19 11:14:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-19 11:14:32,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:32,316 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:32,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 11:14:32,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:32,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1681845663, now seen corresponding path program 1 times [2024-11-19 11:14:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302987662] [2024-11-19 11:14:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-19 11:14:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302987662] [2024-11-19 11:14:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302987662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044000298] [2024-11-19 11:14:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:32,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:32,384 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:32,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 11:14:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:32,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 11:14:32,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-19 11:14:32,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044000298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:32,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-19 11:14:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185658242] [2024-11-19 11:14:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:32,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:32,585 INFO L87 Difference]: Start difference. First operand 7364 states and 8323 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-19 11:14:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:32,936 INFO L93 Difference]: Finished difference Result 7729 states and 8736 transitions. [2024-11-19 11:14:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 279 [2024-11-19 11:14:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:32,958 INFO L225 Difference]: With dead ends: 7729 [2024-11-19 11:14:32,958 INFO L226 Difference]: Without dead ends: 7365 [2024-11-19 11:14:32,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 11:14:32,960 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 46 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:32,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2024-11-19 11:14:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 7364. [2024-11-19 11:14:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 6272 states have (on average 1.1135204081632653) internal successors, (6984), 6317 states have internal predecessors, (6984), 590 states have call successors, (590), 390 states have call predecessors, (590), 498 states have return successors, (740), 656 states have call predecessors, (740), 590 states have call successors, (740) [2024-11-19 11:14:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 8314 transitions. [2024-11-19 11:14:33,318 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 8314 transitions. Word has length 279 [2024-11-19 11:14:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 8314 transitions. [2024-11-19 11:14:33,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-19 11:14:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 8314 transitions. [2024-11-19 11:14:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-19 11:14:33,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:33,323 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:33,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 11:14:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 11:14:33,525 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1318444317, now seen corresponding path program 1 times [2024-11-19 11:14:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772192079] [2024-11-19 11:14:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 82 proven. 5 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-19 11:14:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772192079] [2024-11-19 11:14:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772192079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961909241] [2024-11-19 11:14:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:33,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 11:14:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:33,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 11:14:33,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 418 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-19 11:14:34,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 11:14:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-11-19 11:14:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961909241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 11:14:34,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 11:14:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-19 11:14:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204523814] [2024-11-19 11:14:34,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 11:14:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 11:14:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 11:14:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 11:14:34,328 INFO L87 Difference]: Start difference. First operand 7364 states and 8314 transitions. Second operand has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 10 states have internal predecessors, (354), 7 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) [2024-11-19 11:14:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:34,792 INFO L93 Difference]: Finished difference Result 17341 states and 19593 transitions. [2024-11-19 11:14:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 11:14:34,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 10 states have internal predecessors, (354), 7 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) Word has length 283 [2024-11-19 11:14:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:34,841 INFO L225 Difference]: With dead ends: 17341 [2024-11-19 11:14:34,841 INFO L226 Difference]: Without dead ends: 9639 [2024-11-19 11:14:34,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2024-11-19 11:14:34,857 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 192 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:34,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 400 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2024-11-19 11:14:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 7897. [2024-11-19 11:14:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7897 states, 6719 states have (on average 1.1083494567643994) internal successors, (7447), 6768 states have internal predecessors, (7447), 637 states have call successors, (637), 419 states have call predecessors, (637), 539 states have return successors, (805), 709 states have call predecessors, (805), 637 states have call successors, (805) [2024-11-19 11:14:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 8889 transitions. [2024-11-19 11:14:35,286 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 8889 transitions. Word has length 283 [2024-11-19 11:14:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:35,286 INFO L471 AbstractCegarLoop]: Abstraction has 7897 states and 8889 transitions. [2024-11-19 11:14:35,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 10 states have internal predecessors, (354), 7 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 7 states have call predecessors, (62), 7 states have call successors, (62) [2024-11-19 11:14:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 8889 transitions. [2024-11-19 11:14:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2024-11-19 11:14:35,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:35,300 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:35,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 11:14:35,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 11:14:35,505 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -20270588, now seen corresponding path program 1 times [2024-11-19 11:14:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456804177] [2024-11-19 11:14:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 332 proven. 76 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2024-11-19 11:14:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456804177] [2024-11-19 11:14:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456804177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069943120] [2024-11-19 11:14:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:35,727 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:35,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 11:14:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:35,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 11:14:35,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1669 backedges. 1030 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-19 11:14:36,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069943120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:36,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-19 11:14:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395462667] [2024-11-19 11:14:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 11:14:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 11:14:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:36,034 INFO L87 Difference]: Start difference. First operand 7897 states and 8889 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 11:14:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:36,191 INFO L93 Difference]: Finished difference Result 12778 states and 14388 transitions. [2024-11-19 11:14:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 11:14:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 508 [2024-11-19 11:14:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:36,209 INFO L225 Difference]: With dead ends: 12778 [2024-11-19 11:14:36,210 INFO L226 Difference]: Without dead ends: 5015 [2024-11-19 11:14:36,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:36,220 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:36,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 318 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 11:14:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2024-11-19 11:14:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 4961. [2024-11-19 11:14:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4961 states, 4323 states have (on average 1.0994679620633818) internal successors, (4753), 4324 states have internal predecessors, (4753), 342 states have call successors, (342), 222 states have call predecessors, (342), 294 states have return successors, (414), 414 states have call predecessors, (414), 342 states have call successors, (414) [2024-11-19 11:14:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 5509 transitions. [2024-11-19 11:14:36,451 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 5509 transitions. Word has length 508 [2024-11-19 11:14:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:36,452 INFO L471 AbstractCegarLoop]: Abstraction has 4961 states and 5509 transitions. [2024-11-19 11:14:36,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-19 11:14:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 5509 transitions. [2024-11-19 11:14:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-19 11:14:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 11:14:36,461 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:36,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 11:14:36,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:36,661 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 11:14:36,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 11:14:36,662 INFO L85 PathProgramCache]: Analyzing trace with hash 90815994, now seen corresponding path program 1 times [2024-11-19 11:14:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 11:14:36,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848464789] [2024-11-19 11:14:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:36,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 11:14:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1797 trivial. 0 not checked. [2024-11-19 11:14:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 11:14:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848464789] [2024-11-19 11:14:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848464789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 11:14:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251556102] [2024-11-19 11:14:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 11:14:36,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 11:14:36,850 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 11:14:36,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 11:14:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 11:14:37,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 11:14:37,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 11:14:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-19 11:14:37,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 11:14:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251556102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 11:14:37,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 11:14:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2024-11-19 11:14:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792338241] [2024-11-19 11:14:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 11:14:37,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 11:14:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 11:14:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 11:14:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:37,781 INFO L87 Difference]: Start difference. First operand 4961 states and 5509 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-19 11:14:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 11:14:37,911 INFO L93 Difference]: Finished difference Result 4961 states and 5509 transitions. [2024-11-19 11:14:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 11:14:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 531 [2024-11-19 11:14:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 11:14:37,920 INFO L225 Difference]: With dead ends: 4961 [2024-11-19 11:14:37,920 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 11:14:37,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 11:14:37,925 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 37 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 11:14:37,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 456 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 11:14:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 11:14:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 11:14:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 11:14:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 11:14:37,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2024-11-19 11:14:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 11:14:37,935 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 11:14:37,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-19 11:14:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 11:14:37,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 11:14:37,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 11:14:37,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 11:14:37,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 11:14:38,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 11:14:38,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 11:14:38,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 11:14:52,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 11:14:52,879 WARN L156 FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (let ((.cse6 (= ~C_1_st~0 0))) (let ((.cse4 (not .cse6)) (.cse5 (not (= |old(~P_1_st~0)| 0))) (.cse1 (<= 1 ~C_1_ev~0)) (.cse0 (<= 1 ~i~0)) (.cse3 (<= ~e~0 0)) (.cse7 (= |old(~C_1_st~0)| 0)) (.cse2 (= ~P_1_pc~0 1))) (and (or (< ~num~0 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) (< ~P_1_ev~0 2)) (or .cse5 .cse6) (or .cse4 .cse7) (= |old(~P_1_st~0)| ~P_1_st~0) (let ((.cse24 (<= 2 ~i~0)) (.cse25 (< ~i~0 2147483646)) (.cse26 (= ~i~0 0)) (.cse16 (= ~P_1_pc~0 0)) (.cse17 (= ~C_1_pc~0 0)) (.cse20 (= ~P_1_ev~0 1)) (.cse21 (= ~C_1_ev~0 1)) (.cse27 (= ~C_1_pc~0 1)) (.cse11 (<= ~num~0 2)) (.cse14 (<= 1 ~num~0)) (.cse28 (<= ~P_1_ev~0 0)) (.cse29 (<= ~C_1_ev~0 0)) (.cse18 (= ~num~0 0)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse13 (<= ~i~0 1)) (.cse22 (<= ~num~0 1)) (.cse23 (<= 0 ~num~0)) (.cse15 (= ~C_1_i~0 1)) (.cse19 (not .cse7)) (.cse12 (<= ~max_loop~0 2))) (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse10 .cse2 .cse3 .cse20 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse19) (and .cse8 .cse9 .cse10 .cse2 .cse3 .cse12 .cse22 .cse23 .cse24 .cse25 .cse15 .cse19) (and .cse3 (not .cse10) .cse16 .cse18 .cse19) (and .cse10 .cse2 .cse3 .cse20 .cse12 .cse22 .cse23 .cse21 .cse24 .cse25 .cse15 .cse19) (and .cse5 .cse26 .cse3 .cse16 .cse17 .cse18) (and .cse0 .cse27 .cse2 .cse3 .cse28 .cse13 .cse29 .cse22 .cse14 .cse15 .cse19) (and .cse0 .cse9 .cse1 .cse27 .cse2 .cse3 .cse18 .cse15 .cse19) (and .cse0 .cse27 .cse2 .cse3 .cse20 .cse11 .cse21 .cse14 .cse15 .cse19) (and .cse26 .cse3 .cse28 (= ~max_loop~0 2) .cse29 .cse16 .cse17 .cse18 .cse15) (and .cse0 .cse27 .cse2 .cse3 .cse20 .cse18 .cse21 .cse15 .cse19) (and .cse0 .cse10 .cse2 .cse3 .cse20 .cse12 .cse13 .cse22 .cse23 .cse21 .cse15 .cse19) (and .cse9 .cse27 .cse11 .cse14 .cse15) (and (or (and .cse0 .cse10 .cse2 .cse3 .cse28 .cse13 .cse29 .cse18 .cse15 .cse19) (and .cse0 .cse8 .cse9 .cse10 .cse2 .cse3 .cse13 .cse22 .cse23 .cse15 .cse19)) .cse12))) (or (= ~C_1_st~0 |old(~C_1_st~0)|) (not .cse2))))) Eliminated clause: (let ((.cse5 (= ~C_1_st~0 0))) (let ((.cse1 (<= 1 ~C_1_ev~0)) (.cse0 (<= 1 ~i~0)) (.cse3 (<= ~e~0 0)) (.cse6 (not (= ~P_1_st~0 0))) (.cse4 (not .cse5)) (.cse2 (= ~P_1_pc~0 1))) (and (or (< ~num~0 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) (< ~P_1_ev~0 2)) (or .cse5 .cse6) (exists ((|old(~C_1_st~0)| Int)) (let ((.cse29 (= |old(~C_1_st~0)| 0))) (and (let ((.cse7 (<= 2 ~C_1_ev~0)) (.cse27 (<= ~i~0 2147483645)) (.cse28 (<= 2 ~i~0)) (.cse9 (= 2 ~C_1_pc~0)) (.cse23 (= ~P_1_ev~0 1)) (.cse11 (<= ~max_loop~0 2)) (.cse21 (<= ~num~0 1)) (.cse22 (<= 0 ~num~0)) (.cse24 (= ~C_1_ev~0 1)) (.cse18 (<= ~P_1_ev~0 0)) (.cse19 (<= ~C_1_ev~0 0)) (.cse20 (= ~i~0 1)) (.cse17 (not .cse29)) (.cse26 (= ~i~0 0)) (.cse14 (= ~P_1_pc~0 0)) (.cse15 (= ~C_1_pc~0 0)) (.cse16 (= ~num~0 0)) (.cse8 (<= 2 ~P_1_ev~0)) (.cse25 (= ~C_1_pc~0 1)) (.cse10 (<= ~num~0 2)) (.cse12 (<= 1 ~num~0)) (.cse13 (= ~C_1_i~0 1))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~i~0 1) .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17) (and .cse11 (or (and .cse9 .cse2 .cse3 .cse18 .cse19 .cse20 .cse16 .cse13 .cse17) (and .cse7 .cse8 .cse9 .cse2 .cse3 .cse20 .cse21 .cse22 .cse13 .cse17))) (and .cse9 .cse2 .cse3 .cse23 .cse10 .cse11 .cse20 .cse24 .cse12 .cse13 .cse17) (and .cse3 (not .cse9) .cse14 .cse16 .cse17) (and .cse0 .cse8 .cse1 .cse25 .cse2 .cse3 .cse16 .cse13 .cse17) (and .cse0 .cse25 .cse2 .cse3 .cse23 .cse10 .cse24 .cse12 .cse13 .cse17) (and .cse26 .cse3 .cse18 (= ~max_loop~0 2) .cse19 .cse14 .cse15 .cse16 .cse13) (and .cse0 .cse25 .cse2 .cse3 .cse23 .cse16 .cse24 .cse13 .cse17) (and .cse9 .cse2 .cse3 .cse23 .cse11 .cse27 .cse21 .cse22 .cse24 .cse28 .cse13 .cse17) (and .cse7 .cse8 .cse9 .cse2 .cse3 .cse11 .cse27 .cse21 .cse22 .cse28 .cse13 .cse17) (and .cse9 .cse2 .cse3 .cse23 .cse11 .cse20 .cse21 .cse22 .cse24 .cse13 .cse17) (and .cse25 .cse2 .cse3 .cse18 .cse19 .cse20 (= ~num~0 1) .cse13 .cse17) (and .cse26 .cse3 .cse14 .cse15 .cse16 .cse6) (and .cse8 .cse25 .cse10 .cse12 .cse13))) (or .cse4 .cse29) (or (= ~C_1_st~0 |old(~C_1_st~0)|) (not .cse2)))))))) [2024-11-19 11:14:52,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 11:14:53,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:14:53 BoogieIcfgContainer [2024-11-19 11:14:53,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 11:14:53,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 11:14:53,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 11:14:53,272 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 11:14:53,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:14:10" (3/4) ... [2024-11-19 11:14:53,276 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 11:14:53,279 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-11-19 11:14:53,280 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-19 11:14:53,280 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-11-19 11:14:53,280 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-11-19 11:14:53,280 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-11-19 11:14:53,280 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-19 11:14:53,292 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-19 11:14:53,293 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 11:14:53,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 11:14:53,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 11:14:53,432 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 11:14:53,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 11:14:53,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 11:14:53,433 INFO L158 Benchmark]: Toolchain (without parser) took 44367.50ms. Allocated memory was 180.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 112.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,434 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 11:14:53,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.47ms. Allocated memory is still 180.4MB. Free memory was 111.7MB in the beginning and 95.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 180.4MB. Free memory was 95.9MB in the beginning and 93.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,434 INFO L158 Benchmark]: Boogie Preprocessor took 52.10ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 91.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,435 INFO L158 Benchmark]: RCFGBuilder took 521.69ms. Allocated memory is still 180.4MB. Free memory was 91.3MB in the beginning and 136.6MB in the end (delta: -45.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,435 INFO L158 Benchmark]: TraceAbstraction took 43183.61ms. Allocated memory was 180.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 135.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 11:14:53,435 INFO L158 Benchmark]: Witness Printer took 161.19ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 11:14:53,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.47ms. Allocated memory is still 180.4MB. Free memory was 111.7MB in the beginning and 95.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 180.4MB. Free memory was 95.9MB in the beginning and 93.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.10ms. Allocated memory is still 180.4MB. Free memory was 93.6MB in the beginning and 91.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.69ms. Allocated memory is still 180.4MB. Free memory was 91.3MB in the beginning and 136.6MB in the end (delta: -45.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43183.61ms. Allocated memory was 180.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 135.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 161.19ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: 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 7 procedures, 123 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 31, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5646 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5628 mSDsluCounter, 13539 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7553 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1756 IncrementalHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 5986 mSDtfsCounter, 1756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4335 GetRequests, 4196 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15379occurred in iteration=23, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 7858 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 8584 NumberOfCodeBlocks, 8584 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 9248 ConstructedInterpolants, 0 QuantifiedInterpolants, 16880 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8886 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 48 InterpolantComputations, 28 PerfectInterpolantSequences, 14463/15501 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 93]: Location Invariant Derived location invariant: ((((((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && (P_1_st != 0)) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) - InvariantResult [Line: 156]: Location Invariant Derived location invariant: ((((((((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || (((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (P_1_st == 0)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (1 <= num)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (P_1_st == 0)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || (((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1))) || (((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (1 <= num)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) - ProcedureContractResult [Line: 374]: Procedure Contract for activate_threads Derived contract for procedure activate_threads. Requires: ((((num < 1) || (((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (C_1_st != 0))) || (P_1_ev < 2)) && ((C_1_st == 0) || (P_1_st != 0))) Ensures: ((((((((((((num < 1) || (((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (\old(P_1_st) == P_1_st)) && (C_1_st != 0)) && (P_1_st != 0))) || (P_1_ev < 2)) && ((\old(P_1_st) != 0) || ((C_1_st == 0) && (P_1_st == 0)))) && (((((P_1_ev != 1) || (2 == C_1_pc)) || ((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (C_1_st != 0)) && (C_1_ev == 1))) || ((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (C_1_st != 0)) && (C_1_ev == 1))) || (P_1_pc != 1))) && ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) || (0 < C_1_ev)) || (P_1_pc != 1))) && ((((\old(P_1_st) == P_1_st) && (C_1_st != 0)) || (P_1_pc != 0)) || (\old(C_1_st) == 0))) && ((((((((((((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (num <= 2)) && (max_loop <= 2)) && (i <= 1)) && (1 <= num)) && (C_1_i == 1)) || ((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (\old(C_1_st) != 0))) || (((((((((((((\old(P_1_st) != 0) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (C_1_ev == 1)) && (2 <= i)) && (C_1_i == 1)) && (\old(C_1_st) != 0))) || (((((2 <= P_1_ev) && (C_1_pc == 1)) && (P_1_pc == 1)) && (num == 0)) && (C_1_i == 1))) || (((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (\old(C_1_st) != 0))) || ((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && (\old(C_1_st) != 0))) || ((((((\old(P_1_st) != 0) && (i == 0)) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0))) || ((((((((((((\old(P_1_st) != 0) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (max_loop <= 2)) && (i == 1)) && (num <= 1)) && (0 <= num)) && (C_1_ev == 1)) && (C_1_i == 1)) && (\old(C_1_st) != 0))) || ((((((C_1_pc == 1) && (P_1_pc == 1)) && (P_1_ev == 1)) && (num <= 2)) && (1 <= num)) && (C_1_i == 1))) || ((((((((((((\old(P_1_st) != 0) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_ev == 1)) && (1 <= num)) && (C_1_i == 1)) && (\old(C_1_st) != 0))) || ((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_i == 1)) && (\old(C_1_st) != 0))) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 1) && (P_1_pc == 1)) && (P_1_ev == 1)) && (num == 0)) && (C_1_i == 1))) || (((((2 <= P_1_ev) && (C_1_pc == 1)) && (num <= 2)) && (1 <= num)) && (C_1_i == 1))) || (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (C_1_i == 1)))) && ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) || ((P_1_st == 0) && (C_1_st == \old(C_1_st)))) || ((C_1_st == 0) && (\old(P_1_st) == P_1_st))) || (2 != C_1_pc)) || ((C_1_st == 0) && (P_1_st == 0)))) && ((\old(P_1_st) == P_1_st) || (i != 0))) && (((((((((1 <= i) && (1 <= C_1_ev)) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (C_1_st != 0)) && (P_1_st != 0)) || (P_1_pc != 1)) || (P_1_ev < 2))) && ((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) - ProcedureContractResult [Line: 250]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: (((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || (((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1))) || (((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (1 <= num)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num <= 1)) && (0 <= num)) && (C_1_i == 1))) Ensures: ((((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1))) || (((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1))) || (((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (1 <= num)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num <= 1)) && (0 <= num)) && (C_1_i == 1))) && (((0 < \result) || (P_1_pc != 1)) || (C_1_st != 0))) && ((0 < \result) || (P_1_st != 0))) && ((((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_st == \old(P_1_st))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_st == \old(C_1_st))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) - ProcedureContractResult [Line: 326]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events. Requires: ((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) Ensures: (((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) && ((((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_st == \old(P_1_st))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_st == \old(C_1_st))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) - ProcedureContractResult [Line: 224]: Procedure Contract for update_channels Derived contract for procedure update_channels. Requires: ((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) Ensures: (((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) && ((((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_st == \old(P_1_st))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_st == \old(C_1_st))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) - ProcedureContractResult [Line: 334]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events. Requires: ((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) Ensures: (((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((max_loop <= 2) && (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0)) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (i == 1)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (C_1_i == 1)) && (P_1_st != 0))))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i <= 2147483645)) && (num <= 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((C_1_pc == 1) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (C_1_st != 0)) && (1 <= num)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (1 <= C_1_ev)) && (C_1_pc == 1)) && (P_1_pc == 1)) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (C_1_i == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) && ((((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_st == \old(P_1_st))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_st == \old(C_1_st))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: ((P_1_pc == 1) || (P_1_pc == 0)) Ensures: (0 && ((((((((((((((((max_loop == \old(max_loop)) && (num == \old(num))) && (i == \old(i))) && (e == \old(e))) && (timer == \old(timer))) && (data_0 == \old(data_0))) && (data_1 == \old(data_1))) && (P_1_pc == \old(P_1_pc))) && (P_1_st == \old(P_1_st))) && (P_1_i == \old(P_1_i))) && (P_1_ev == \old(P_1_ev))) && (C_1_pc == \old(C_1_pc))) && (C_1_st == \old(C_1_st))) && (C_1_i == \old(C_1_i))) && (C_1_ev == \old(C_1_ev))) && (C_1_pr == \old(C_1_pr)))) RESULT: Ultimate proved your program to be correct! [2024-11-19 11:14:53,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE