./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:53:42,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:53:42,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:53:42,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:53:42,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:53:42,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:53:42,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:53:42,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:53:42,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:53:42,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:53:42,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:53:42,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:53:42,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:53:42,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:53:42,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:53:42,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:53:42,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:53:42,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:53:42,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:53:42,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:53:42,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:53:42,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:53:42,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:53:42,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:53:42,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:53:42,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:53:42,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:53:42,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:53:42,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:53:42,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:53:42,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:53:42,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:53:42,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:53:42,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:53:42,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:53:42,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:53:42,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:53:42,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:53:42,721 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-12 17:53:42,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:53:42,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:53:42,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:53:42,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:53:42,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:53:42,944 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-12 17:53:44,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:53:44,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:53:44,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-12 17:53:44,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c1c8fbb/9c1ff297fa80418f9f33ce17258b6234/FLAG38ef27451 [2024-11-12 17:53:44,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c1c8fbb/9c1ff297fa80418f9f33ce17258b6234 [2024-11-12 17:53:44,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:53:44,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:53:44,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:53:44,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:53:44,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:53:44,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46045cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44, skipping insertion in model container [2024-11-12 17:53:44,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:53:44,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:53:44,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:53:44,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:53:44,941 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:53:44,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44 WrapperNode [2024-11-12 17:53:44,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:53:44,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:53:44,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:53:44,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:53:44,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,977 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 271 [2024-11-12 17:53:44,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:53:44,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:53:44,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:53:44,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:53:44,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:44,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,001 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 17:53:45,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:53:45,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:53:45,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:53:45,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:53:45,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (1/1) ... [2024-11-12 17:53:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:53:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:45,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:53:45,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:53:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:53:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-12 17:53:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-12 17:53:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-12 17:53:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-12 17:53:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-12 17:53:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-12 17:53:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-12 17:53:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-12 17:53:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-12 17:53:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-12 17:53:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:53:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-12 17:53:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-12 17:53:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:53:45,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:53:45,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:53:45,181 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:53:45,429 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-12 17:53:45,429 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:53:45,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:53:45,445 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 17:53:45,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:53:45 BoogieIcfgContainer [2024-11-12 17:53:45,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:53:45,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:53:45,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:53:45,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:53:45,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:53:44" (1/3) ... [2024-11-12 17:53:45,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ccb7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:53:45, skipping insertion in model container [2024-11-12 17:53:45,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:44" (2/3) ... [2024-11-12 17:53:45,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ccb7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:53:45, skipping insertion in model container [2024-11-12 17:53:45,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:53:45" (3/3) ... [2024-11-12 17:53:45,453 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-12 17:53:45,467 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:53:45,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 17:53:45,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:53:45,522 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;@5ea9e0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:53:45,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 17:53:45,526 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-12 17:53:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 17:53:45,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:45,532 INFO L218 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-12 17:53:45,532 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-12 17:53:45,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:45,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1980410107, now seen corresponding path program 1 times [2024-11-12 17:53:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236682407] [2024-11-12 17:53:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:53:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 17:53:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236682407] [2024-11-12 17:53:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236682407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:53:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136210487] [2024-11-12 17:53:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:45,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:45,860 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 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-12 17:53:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:46,108 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2024-11-12 17:53:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:53:46,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 48 [2024-11-12 17:53:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:46,121 INFO L225 Difference]: With dead ends: 360 [2024-11-12 17:53:46,121 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 17:53:46,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-12 17:53:46,127 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 321 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:46,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 732 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:53:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 17:53:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2024-11-12 17:53:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.4331210191082802) internal successors, (225), 165 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-12 17:53:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2024-11-12 17:53:46,172 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2024-11-12 17:53:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2024-11-12 17:53:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-12 17:53:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2024-11-12 17:53:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 17:53:46,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:46,175 INFO L218 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-12 17:53:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:53:46,175 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-12 17:53:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 737999430, now seen corresponding path program 1 times [2024-11-12 17:53:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778555886] [2024-11-12 17:53:46,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:53:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 17:53:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:46,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778555886] [2024-11-12 17:53:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778555886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:53:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120592970] [2024-11-12 17:53:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:46,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:53:46,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:53:46,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:46,343 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-12 17:53:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:46,483 INFO L93 Difference]: Finished difference Result 396 states and 545 transitions. [2024-11-12 17:53:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:53:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 48 [2024-11-12 17:53:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:46,485 INFO L225 Difference]: With dead ends: 396 [2024-11-12 17:53:46,485 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 17:53:46,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:46,487 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 36 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:46,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 618 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 17:53:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2024-11-12 17:53:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.41875) internal successors, (227), 168 states have internal predecessors, (227), 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-12 17:53:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2024-11-12 17:53:46,504 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2024-11-12 17:53:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:46,505 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2024-11-12 17:53:46,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-12 17:53:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2024-11-12 17:53:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 17:53:46,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:46,507 INFO L218 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-12 17:53:46,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:53:46,508 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-12 17:53:46,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2124202824, now seen corresponding path program 1 times [2024-11-12 17:53:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945030953] [2024-11-12 17:53:46,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 17:53:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 17:53:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945030953] [2024-11-12 17:53:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945030953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:53:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665877696] [2024-11-12 17:53:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:46,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:53:46,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:53:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:46,645 INFO L87 Difference]: Start difference. First operand 198 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-12 17:53:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:46,969 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2024-11-12 17:53:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:53:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 48 [2024-11-12 17:53:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:46,973 INFO L225 Difference]: With dead ends: 784 [2024-11-12 17:53:46,973 INFO L226 Difference]: Without dead ends: 596 [2024-11-12 17:53:46,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:53:46,976 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 603 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:46,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 736 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:53:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-12 17:53:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2024-11-12 17:53:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.3944636678200693) internal successors, (403), 297 states have internal predecessors, (403), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2024-11-12 17:53:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2024-11-12 17:53:47,017 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2024-11-12 17:53:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:47,017 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2024-11-12 17:53:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-12 17:53:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2024-11-12 17:53:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 17:53:47,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:47,020 INFO L218 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-12 17:53:47,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:53:47,020 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-12 17:53:47,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 349081956, now seen corresponding path program 1 times [2024-11-12 17:53:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:47,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605812990] [2024-11-12 17:53:47,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:47,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605812990] [2024-11-12 17:53:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605812990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:47,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:53:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866404749] [2024-11-12 17:53:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:47,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:47,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:47,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:47,117 INFO L87 Difference]: Start difference. First operand 353 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.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-12 17:53:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:47,356 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2024-11-12 17:53:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:53:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.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-12 17:53:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:47,364 INFO L225 Difference]: With dead ends: 1262 [2024-11-12 17:53:47,364 INFO L226 Difference]: Without dead ends: 919 [2024-11-12 17:53:47,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-12 17:53:47,367 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 306 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:47,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 788 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:53:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-12 17:53:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2024-11-12 17:53:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 640 states have (on average 1.334375) internal successors, (854), 648 states have internal predecessors, (854), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2024-11-12 17:53:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2024-11-12 17:53:47,428 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2024-11-12 17:53:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2024-11-12 17:53:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.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-12 17:53:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2024-11-12 17:53:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 17:53:47,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:47,431 INFO L218 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-12 17:53:47,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:53:47,432 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-12 17:53:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 40642947, now seen corresponding path program 1 times [2024-11-12 17:53:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:47,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557374558] [2024-11-12 17:53:47,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:47,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557374558] [2024-11-12 17:53:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557374558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:53:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373289147] [2024-11-12 17:53:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:53:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:53:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:47,513 INFO L87 Difference]: Start difference. First operand 782 states and 1036 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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-12 17:53:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:47,686 INFO L93 Difference]: Finished difference Result 1615 states and 2188 transitions. [2024-11-12 17:53:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:53:47,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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-12 17:53:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:47,691 INFO L225 Difference]: With dead ends: 1615 [2024-11-12 17:53:47,691 INFO L226 Difference]: Without dead ends: 843 [2024-11-12 17:53:47,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:47,694 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 36 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:47,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-12 17:53:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 800. [2024-11-12 17:53:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 658 states have (on average 1.3191489361702127) internal successors, (868), 666 states have internal predecessors, (868), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2024-11-12 17:53:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2024-11-12 17:53:47,752 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2024-11-12 17:53:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2024-11-12 17:53:47,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 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-12 17:53:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2024-11-12 17:53:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 17:53:47,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:47,754 INFO L218 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-12 17:53:47,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:53:47,755 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-12 17:53:47,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -93370559, now seen corresponding path program 1 times [2024-11-12 17:53:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56475272] [2024-11-12 17:53:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:47,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56475272] [2024-11-12 17:53:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56475272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:47,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:53:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695460121] [2024-11-12 17:53:47,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:47,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:47,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:47,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:47,819 INFO L87 Difference]: Start difference. First operand 800 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 17:53:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:47,971 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2024-11-12 17:53:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:53:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-12 17:53:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:47,977 INFO L225 Difference]: With dead ends: 2356 [2024-11-12 17:53:47,977 INFO L226 Difference]: Without dead ends: 1567 [2024-11-12 17:53:47,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:53:47,979 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 184 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:47,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 430 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-12 17:53:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2024-11-12 17:53:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1259 states have (on average 1.289118347895155) internal successors, (1623), 1271 states have internal predecessors, (1623), 167 states have call successors, (167), 100 states have call predecessors, (167), 103 states have return successors, (233), 167 states have call predecessors, (233), 167 states have call successors, (233) [2024-11-12 17:53:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2024-11-12 17:53:48,057 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2024-11-12 17:53:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:48,057 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2024-11-12 17:53:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 17:53:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2024-11-12 17:53:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 17:53:48,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:48,058 INFO L218 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-12 17:53:48,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 17:53:48,058 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-12 17:53:48,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash 229733577, now seen corresponding path program 1 times [2024-11-12 17:53:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473959685] [2024-11-12 17:53:48,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473959685] [2024-11-12 17:53:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473959685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:53:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513021899] [2024-11-12 17:53:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:53:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:53:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:53:48,131 INFO L87 Difference]: Start difference. First operand 1537 states and 2023 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:48,309 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2024-11-12 17:53:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:53:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:48,318 INFO L225 Difference]: With dead ends: 4093 [2024-11-12 17:53:48,319 INFO L226 Difference]: Without dead ends: 2700 [2024-11-12 17:53:48,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12 17:53:48,322 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 180 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 357 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-11-12 17:53:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2024-11-12 17:53:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2131 states have (on average 1.278742374472079) internal successors, (2725), 2146 states have internal predecessors, (2725), 279 states have call successors, (279), 170 states have call predecessors, (279), 176 states have return successors, (398), 279 states have call predecessors, (398), 279 states have call successors, (398) [2024-11-12 17:53:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2024-11-12 17:53:48,438 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2024-11-12 17:53:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2024-11-12 17:53:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2024-11-12 17:53:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 17:53:48,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:48,439 INFO L218 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-12 17:53:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 17:53:48,440 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-12 17:53:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1971660673, now seen corresponding path program 1 times [2024-11-12 17:53:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096234599] [2024-11-12 17:53:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:48,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096234599] [2024-11-12 17:53:48,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096234599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:48,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:48,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:53:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806915649] [2024-11-12 17:53:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:48,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:53:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:53:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:53:48,490 INFO L87 Difference]: Start difference. First operand 2594 states and 3402 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:48,660 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2024-11-12 17:53:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:53:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:48,689 INFO L225 Difference]: With dead ends: 3062 [2024-11-12 17:53:48,689 INFO L226 Difference]: Without dead ends: 3058 [2024-11-12 17:53:48,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12 17:53:48,690 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:48,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 374 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2024-11-12 17:53:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2024-11-12 17:53:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2423 states have (on average 1.2736277342137845) internal successors, (3086), 2439 states have internal predecessors, (3086), 311 states have call successors, (311), 190 states have call predecessors, (311), 197 states have return successors, (442), 311 states have call predecessors, (442), 311 states have call successors, (442) [2024-11-12 17:53:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2024-11-12 17:53:48,818 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2024-11-12 17:53:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:48,818 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2024-11-12 17:53:48,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 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-12 17:53:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2024-11-12 17:53:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 17:53:48,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:48,819 INFO L218 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-12 17:53:48,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:53:48,819 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-12 17:53:48,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 395990028, now seen corresponding path program 1 times [2024-11-12 17:53:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228255900] [2024-11-12 17:53:48,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228255900] [2024-11-12 17:53:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228255900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:53:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18509025] [2024-11-12 17:53:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:48,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:48,866 INFO L87 Difference]: Start difference. First operand 2939 states and 3839 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 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-12 17:53:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:49,129 INFO L93 Difference]: Finished difference Result 5264 states and 6962 transitions. [2024-11-12 17:53:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:53:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 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-12 17:53:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:49,144 INFO L225 Difference]: With dead ends: 5264 [2024-11-12 17:53:49,144 INFO L226 Difference]: Without dead ends: 3386 [2024-11-12 17:53:49,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-12 17:53:49,152 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 305 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:49,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 610 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2024-11-12 17:53:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3248. [2024-11-12 17:53:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2679 states have (on average 1.2695035460992907) internal successors, (3401), 2696 states have internal predecessors, (3401), 343 states have call successors, (343), 210 states have call predecessors, (343), 218 states have return successors, (486), 343 states have call predecessors, (486), 343 states have call successors, (486) [2024-11-12 17:53:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4230 transitions. [2024-11-12 17:53:49,304 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4230 transitions. Word has length 59 [2024-11-12 17:53:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:49,305 INFO L471 AbstractCegarLoop]: Abstraction has 3248 states and 4230 transitions. [2024-11-12 17:53:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 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-12 17:53:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4230 transitions. [2024-11-12 17:53:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 17:53:49,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:49,306 INFO L218 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-12 17:53:49,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 17:53:49,307 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-12 17:53:49,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash -609210758, now seen corresponding path program 1 times [2024-11-12 17:53:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:49,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382472396] [2024-11-12 17:53:49,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:53:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:49,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382472396] [2024-11-12 17:53:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382472396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:53:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054505849] [2024-11-12 17:53:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:49,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:49,365 INFO L87 Difference]: Start difference. First operand 3248 states and 4230 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 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-12 17:53:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:49,653 INFO L93 Difference]: Finished difference Result 5046 states and 6653 transitions. [2024-11-12 17:53:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:53:49,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 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-12 17:53:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:49,673 INFO L225 Difference]: With dead ends: 5046 [2024-11-12 17:53:49,673 INFO L226 Difference]: Without dead ends: 5044 [2024-11-12 17:53:49,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-12 17:53:49,676 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 381 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:49,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 493 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:53:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2024-11-12 17:53:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4823. [2024-11-12 17:53:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3989 states have (on average 1.266984206568062) internal successors, (5054), 4011 states have internal predecessors, (5054), 503 states have call successors, (503), 310 states have call predecessors, (503), 323 states have return successors, (720), 503 states have call predecessors, (720), 503 states have call successors, (720) [2024-11-12 17:53:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6277 transitions. [2024-11-12 17:53:49,902 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6277 transitions. Word has length 60 [2024-11-12 17:53:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:49,903 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 6277 transitions. [2024-11-12 17:53:49,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 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-12 17:53:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6277 transitions. [2024-11-12 17:53:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 17:53:49,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:49,904 INFO L218 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-12 17:53:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 17:53:49,905 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-12 17:53:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1069966793, now seen corresponding path program 1 times [2024-11-12 17:53:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916345985] [2024-11-12 17:53:49,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:53:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:49,949 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-12 17:53:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916345985] [2024-11-12 17:53:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916345985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:53:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477924787] [2024-11-12 17:53:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:49,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:53:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:53:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:49,951 INFO L87 Difference]: Start difference. First operand 4823 states and 6277 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:53:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:50,411 INFO L93 Difference]: Finished difference Result 13328 states and 17731 transitions. [2024-11-12 17:53:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:53:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2024-11-12 17:53:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:50,446 INFO L225 Difference]: With dead ends: 13328 [2024-11-12 17:53:50,447 INFO L226 Difference]: Without dead ends: 8521 [2024-11-12 17:53:50,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:50,461 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 455 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:50,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 606 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:53:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2024-11-12 17:53:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8239. [2024-11-12 17:53:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8239 states, 6727 states have (on average 1.2430503939348891) internal successors, (8362), 6799 states have internal predecessors, (8362), 893 states have call successors, (893), 550 states have call predecessors, (893), 611 states have return successors, (1678), 893 states have call predecessors, (1678), 893 states have call successors, (1678) [2024-11-12 17:53:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 10933 transitions. [2024-11-12 17:53:50,899 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 10933 transitions. Word has length 70 [2024-11-12 17:53:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 8239 states and 10933 transitions. [2024-11-12 17:53:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:53:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 10933 transitions. [2024-11-12 17:53:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 17:53:50,902 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:50,902 INFO L218 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-12 17:53:50,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 17:53:50,902 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-12 17:53:50,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1242824384, now seen corresponding path program 1 times [2024-11-12 17:53:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906538286] [2024-11-12 17:53:50,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:53:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:50,965 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-12 17:53:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906538286] [2024-11-12 17:53:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906538286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:50,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:53:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:53:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610247265] [2024-11-12 17:53:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:53:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:53:50,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:50,968 INFO L87 Difference]: Start difference. First operand 8239 states and 10933 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 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-12 17:53:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:51,630 INFO L93 Difference]: Finished difference Result 16593 states and 22002 transitions. [2024-11-12 17:53:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:53:51,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 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 82 [2024-11-12 17:53:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:51,658 INFO L225 Difference]: With dead ends: 16593 [2024-11-12 17:53:51,659 INFO L226 Difference]: Without dead ends: 7947 [2024-11-12 17:53:51,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:53:51,678 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 678 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:51,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 854 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:53:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2024-11-12 17:53:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 7719. [2024-11-12 17:53:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7719 states, 6301 states have (on average 1.228059038247897) internal successors, (7738), 6372 states have internal predecessors, (7738), 834 states have call successors, (834), 515 states have call predecessors, (834), 576 states have return successors, (1435), 834 states have call predecessors, (1435), 834 states have call successors, (1435) [2024-11-12 17:53:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 10007 transitions. [2024-11-12 17:53:52,011 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 10007 transitions. Word has length 82 [2024-11-12 17:53:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 7719 states and 10007 transitions. [2024-11-12 17:53:52,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 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-12 17:53:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 10007 transitions. [2024-11-12 17:53:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-12 17:53:52,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:52,016 INFO L218 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-12 17:53:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 17:53:52,017 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-12 17:53:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1450817259, now seen corresponding path program 1 times [2024-11-12 17:53:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861718581] [2024-11-12 17:53:52,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:53:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 17:53:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:53:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 17:53:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 17:53:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 17:53:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 17:53:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-12 17:53:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861718581] [2024-11-12 17:53:52,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861718581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472400206] [2024-11-12 17:53:52,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:52,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:52,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:52,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:52,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:53:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:53:52,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:52,293 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-12 17:53:52,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472400206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:52,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:52,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-12 17:53:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449727618] [2024-11-12 17:53:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:52,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:52,295 INFO L87 Difference]: Start difference. First operand 7719 states and 10007 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-12 17:53:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:52,502 INFO L93 Difference]: Finished difference Result 12033 states and 15714 transitions. [2024-11-12 17:53:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:52,503 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-12 17:53:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:52,524 INFO L225 Difference]: With dead ends: 12033 [2024-11-12 17:53:52,525 INFO L226 Difference]: Without dead ends: 5587 [2024-11-12 17:53:52,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:52,539 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 146 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-12 17:53:52,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2024-11-12 17:53:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5587. [2024-11-12 17:53:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4555 states have (on average 1.2169045005488475) internal successors, (5543), 4604 states have internal predecessors, (5543), 610 states have call successors, (610), 375 states have call predecessors, (610), 414 states have return successors, (977), 610 states have call predecessors, (977), 610 states have call successors, (977) [2024-11-12 17:53:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7130 transitions. [2024-11-12 17:53:52,774 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7130 transitions. Word has length 127 [2024-11-12 17:53:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:52,775 INFO L471 AbstractCegarLoop]: Abstraction has 5587 states and 7130 transitions. [2024-11-12 17:53:52,775 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-12 17:53:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7130 transitions. [2024-11-12 17:53:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 17:53:52,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:52,780 INFO L218 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, 1, 1, 1] [2024-11-12 17:53:52,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:53:52,980 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-12 17:53:52,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:52,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash 32864813, now seen corresponding path program 1 times [2024-11-12 17:53:52,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:52,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529539660] [2024-11-12 17:53:52,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:53:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 17:53:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:53:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:53:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 17:53:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 17:53:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 17:53:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:53:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:53,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529539660] [2024-11-12 17:53:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529539660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165900483] [2024-11-12 17:53:53,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:53,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:53,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:53,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:53,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:53:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:53,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:53:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-12 17:53:53,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165900483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-12 17:53:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148552243] [2024-11-12 17:53:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:53,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:53,273 INFO L87 Difference]: Start difference. First operand 5587 states and 7130 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-12 17:53:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:53,716 INFO L93 Difference]: Finished difference Result 12745 states and 16166 transitions. [2024-11-12 17:53:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 130 [2024-11-12 17:53:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:53,742 INFO L225 Difference]: With dead ends: 12745 [2024-11-12 17:53:53,743 INFO L226 Difference]: Without dead ends: 8431 [2024-11-12 17:53:53,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:53,756 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 284 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-12 17:53:53,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2024-11-12 17:53:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8428. [2024-11-12 17:53:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 6846 states have (on average 1.1958808063102542) internal successors, (8187), 6905 states have internal predecessors, (8187), 925 states have call successors, (925), 600 states have call predecessors, (925), 649 states have return successors, (1342), 925 states have call predecessors, (1342), 925 states have call successors, (1342) [2024-11-12 17:53:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 10454 transitions. [2024-11-12 17:53:54,224 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 10454 transitions. Word has length 130 [2024-11-12 17:53:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:54,224 INFO L471 AbstractCegarLoop]: Abstraction has 8428 states and 10454 transitions. [2024-11-12 17:53:54,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-12 17:53:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 10454 transitions. [2024-11-12 17:53:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-12 17:53:54,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:54,229 INFO L218 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-12 17:53:54,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 17:53:54,429 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-12 17:53:54,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:54,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 865439513, now seen corresponding path program 1 times [2024-11-12 17:53:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9635606] [2024-11-12 17:53:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:53:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 17:53:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:53:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 17:53:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:53:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 17:53:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 17:53:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 17:53:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9635606] [2024-11-12 17:53:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9635606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203188312] [2024-11-12 17:53:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:54,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:54,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:54,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:54,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:53:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:54,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:53:54,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:54,691 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-12 17:53:54,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203188312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:54,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-12 17:53:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180838647] [2024-11-12 17:53:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:54,694 INFO L87 Difference]: Start difference. First operand 8428 states and 10454 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-12 17:53:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:54,889 INFO L93 Difference]: Finished difference Result 13900 states and 17415 transitions. [2024-11-12 17:53:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:54,890 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-12 17:53:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:54,908 INFO L225 Difference]: With dead ends: 13900 [2024-11-12 17:53:54,908 INFO L226 Difference]: Without dead ends: 6508 [2024-11-12 17:53:54,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:54,922 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 278 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-12 17:53:54,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2024-11-12 17:53:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6508. [2024-11-12 17:53:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 5284 states have (on average 1.2036336109008328) internal successors, (6360), 5333 states have internal predecessors, (6360), 722 states have call successors, (722), 455 states have call predecessors, (722), 494 states have return successors, (1101), 722 states have call predecessors, (1101), 722 states have call successors, (1101) [2024-11-12 17:53:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 8183 transitions. [2024-11-12 17:53:55,147 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 8183 transitions. Word has length 141 [2024-11-12 17:53:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 6508 states and 8183 transitions. [2024-11-12 17:53:55,148 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-12 17:53:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 8183 transitions. [2024-11-12 17:53:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 17:53:55,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:55,152 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:53:55,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 17:53:55,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:55,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:55,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1011745838, now seen corresponding path program 1 times [2024-11-12 17:53:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334878019] [2024-11-12 17:53:55,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:53:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 17:53:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:53:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:53:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 17:53:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 17:53:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 17:53:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 17:53:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-12 17:53:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334878019] [2024-11-12 17:53:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334878019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665276439] [2024-11-12 17:53:55,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:55,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:55,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:55,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:53:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:55,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:53:55,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:53:55,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665276439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-12 17:53:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075863998] [2024-11-12 17:53:55,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:55,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:55,626 INFO L87 Difference]: Start difference. First operand 6508 states and 8183 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 17:53:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:55,755 INFO L93 Difference]: Finished difference Result 8734 states and 11097 transitions. [2024-11-12 17:53:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2024-11-12 17:53:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:55,766 INFO L225 Difference]: With dead ends: 8734 [2024-11-12 17:53:55,767 INFO L226 Difference]: Without dead ends: 3722 [2024-11-12 17:53:55,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:55,773 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 86 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:55,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 260 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2024-11-12 17:53:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3719. [2024-11-12 17:53:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3031 states have (on average 1.1956450016496205) internal successors, (3624), 3059 states have internal predecessors, (3624), 406 states have call successors, (406), 255 states have call predecessors, (406), 274 states have return successors, (537), 406 states have call predecessors, (537), 406 states have call successors, (537) [2024-11-12 17:53:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4567 transitions. [2024-11-12 17:53:55,895 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4567 transitions. Word has length 151 [2024-11-12 17:53:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 3719 states and 4567 transitions. [2024-11-12 17:53:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 17:53:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4567 transitions. [2024-11-12 17:53:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 17:53:55,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:55,899 INFO L218 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-12 17:53:55,913 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-12 17:53:56,103 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,SelfDestructingSolverStorable15 [2024-11-12 17:53:56,104 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-12 17:53:56,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2052588499, now seen corresponding path program 1 times [2024-11-12 17:53:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823944153] [2024-11-12 17:53:56,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:53:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 17:53:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:53:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 17:53:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 17:53:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 17:53:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 17:53:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:53:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 17:53:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823944153] [2024-11-12 17:53:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823944153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660667285] [2024-11-12 17:53:56,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:56,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:56,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:56,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:53:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:53:56,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:56,300 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-12 17:53:56,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660667285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-12 17:53:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11436156] [2024-11-12 17:53:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:56,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:56,302 INFO L87 Difference]: Start difference. First operand 3719 states and 4567 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-12 17:53:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:56,455 INFO L93 Difference]: Finished difference Result 8907 states and 10999 transitions. [2024-11-12 17:53:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:56,455 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-12 17:53:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:56,470 INFO L225 Difference]: With dead ends: 8907 [2024-11-12 17:53:56,470 INFO L226 Difference]: Without dead ends: 5738 [2024-11-12 17:53:56,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:53:56,476 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 104 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 391 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-12 17:53:56,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2024-11-12 17:53:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5728. [2024-11-12 17:53:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 4712 states have (on average 1.1808149405772497) internal successors, (5564), 4751 states have internal predecessors, (5564), 581 states have call successors, (581), 397 states have call predecessors, (581), 427 states have return successors, (796), 581 states have call predecessors, (796), 581 states have call successors, (796) [2024-11-12 17:53:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 6941 transitions. [2024-11-12 17:53:56,708 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 6941 transitions. Word has length 164 [2024-11-12 17:53:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 5728 states and 6941 transitions. [2024-11-12 17:53:56,708 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-12 17:53:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 6941 transitions. [2024-11-12 17:53:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 17:53:56,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:56,711 INFO L218 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-12 17:53:56,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:53:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 17:53:56,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1155195221, now seen corresponding path program 1 times [2024-11-12 17:53:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727378594] [2024-11-12 17:53:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:53:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 17:53:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 17:53:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 17:53:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 17:53:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 17:53:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 17:53:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 17:53:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:53:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 17:53:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727378594] [2024-11-12 17:53:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727378594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162288561] [2024-11-12 17:53:57,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:57,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:57,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:53:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:53:57,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:57,126 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-12 17:53:57,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162288561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:57,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-12 17:53:57,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140935145] [2024-11-12 17:53:57,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:57,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:53:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:53:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:53:57,129 INFO L87 Difference]: Start difference. First operand 5728 states and 6941 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-12 17:53:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:57,230 INFO L93 Difference]: Finished difference Result 9077 states and 11026 transitions. [2024-11-12 17:53:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:53:57,230 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-12 17:53:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:57,243 INFO L225 Difference]: With dead ends: 9077 [2024-11-12 17:53:57,243 INFO L226 Difference]: Without dead ends: 3364 [2024-11-12 17:53:57,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:53:57,250 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 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-12 17:53:57,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2024-11-12 17:53:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3364. [2024-11-12 17:53:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2871 states have (on average 1.1894810170672239) internal successors, (3415), 2884 states have internal predecessors, (3415), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2024-11-12 17:53:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4071 transitions. [2024-11-12 17:53:57,349 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4071 transitions. Word has length 164 [2024-11-12 17:53:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:57,350 INFO L471 AbstractCegarLoop]: Abstraction has 3364 states and 4071 transitions. [2024-11-12 17:53:57,350 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-12 17:53:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4071 transitions. [2024-11-12 17:53:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 17:53:57,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:57,354 INFO L218 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] [2024-11-12 17:53:57,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:53:57,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 17:53:57,555 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:57,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1903534116, now seen corresponding path program 1 times [2024-11-12 17:53:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666179114] [2024-11-12 17:53:57,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:53:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:53:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:53:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:53:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 17:53:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 17:53:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 17:53:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 17:53:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 17:53:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 17:53:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666179114] [2024-11-12 17:53:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666179114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827290815] [2024-11-12 17:53:57,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:57,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:57,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:53:57,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:53:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:57,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:53:57,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-12 17:53:57,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827290815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:57,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 17:53:57,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791036883] [2024-11-12 17:53:57,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:57,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:57,795 INFO L87 Difference]: Start difference. First operand 3364 states and 4071 transitions. Second operand has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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-12 17:53:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:57,874 INFO L93 Difference]: Finished difference Result 3364 states and 4071 transitions. [2024-11-12 17:53:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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 168 [2024-11-12 17:53:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:57,884 INFO L225 Difference]: With dead ends: 3364 [2024-11-12 17:53:57,885 INFO L226 Difference]: Without dead ends: 3362 [2024-11-12 17:53:57,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:57,885 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 133 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-12 17:53:57,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2024-11-12 17:53:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3362. [2024-11-12 17:53:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 2871 states have (on average 1.1818181818181819) internal successors, (3393), 2882 states have internal predecessors, (3393), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2024-11-12 17:53:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4049 transitions. [2024-11-12 17:53:58,034 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4049 transitions. Word has length 168 [2024-11-12 17:53:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:58,035 INFO L471 AbstractCegarLoop]: Abstraction has 3362 states and 4049 transitions. [2024-11-12 17:53:58,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 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-12 17:53:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4049 transitions. [2024-11-12 17:53:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 17:53:58,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:58,039 INFO L218 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] [2024-11-12 17:53:58,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 17:53:58,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:58,239 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1449759974, now seen corresponding path program 1 times [2024-11-12 17:53:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234707936] [2024-11-12 17:53:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:53:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:53:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:53:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:53:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 17:53:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 17:53:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 17:53:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 17:53:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 17:53:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-12 17:53:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234707936] [2024-11-12 17:53:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234707936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5937332] [2024-11-12 17:53:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:58,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:58,315 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-12 17:53:58,316 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-12 17:53:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:58,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:53:58,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 17:53:58,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5937332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-12 17:53:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411199074] [2024-11-12 17:53:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:58,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:53:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:53:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:53:58,439 INFO L87 Difference]: Start difference. First operand 3362 states and 4049 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 17:53:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:58,605 INFO L93 Difference]: Finished difference Result 5976 states and 7312 transitions. [2024-11-12 17:53:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:53:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 169 [2024-11-12 17:53:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:58,617 INFO L225 Difference]: With dead ends: 5976 [2024-11-12 17:53:58,618 INFO L226 Difference]: Without dead ends: 3283 [2024-11-12 17:53:58,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 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-12 17:53:58,623 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 90 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:58,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 347 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-11-12 17:53:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3282. [2024-11-12 17:53:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2791 states have (on average 1.171981368685059) internal successors, (3271), 2802 states have internal predecessors, (3271), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2024-11-12 17:53:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 3927 transitions. [2024-11-12 17:53:58,805 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 3927 transitions. Word has length 169 [2024-11-12 17:53:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:58,805 INFO L471 AbstractCegarLoop]: Abstraction has 3282 states and 3927 transitions. [2024-11-12 17:53:58,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-12 17:53:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 3927 transitions. [2024-11-12 17:53:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 17:53:58,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:58,808 INFO L218 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-12 17:53:58,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 17:53:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:59,009 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1227816467, now seen corresponding path program 1 times [2024-11-12 17:53:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3624235] [2024-11-12 17:53:59,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:53:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:53:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:53:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:53:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:53:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:53:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:53:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:53:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:53:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:53:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:53:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:53:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:53:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:53:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,115 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-12 17:53:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:53:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3624235] [2024-11-12 17:53:59,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3624235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:53:59,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625939168] [2024-11-12 17:53:59,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:53:59,118 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-12 17:53:59,119 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-12 17:53:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:53:59,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:53:59,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:53:59,363 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-12 17:53:59,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:53:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625939168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:53:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:53:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-12 17:53:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520096375] [2024-11-12 17:53:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:53:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:53:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:53:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:53:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:59,366 INFO L87 Difference]: Start difference. First operand 3282 states and 3927 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-12 17:53:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:53:59,557 INFO L93 Difference]: Finished difference Result 3283 states and 3927 transitions. [2024-11-12 17:53:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:53:59,557 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-12 17:53:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:53:59,567 INFO L225 Difference]: With dead ends: 3283 [2024-11-12 17:53:59,567 INFO L226 Difference]: Without dead ends: 3281 [2024-11-12 17:53:59,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:53:59,568 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 113 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:53:59,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 306 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:53:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2024-11-12 17:53:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3280. [2024-11-12 17:53:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2791 states have (on average 1.1648154783231817) internal successors, (3251), 2800 states have internal predecessors, (3251), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2024-11-12 17:53:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 3907 transitions. [2024-11-12 17:53:59,751 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 3907 transitions. Word has length 170 [2024-11-12 17:53:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:53:59,752 INFO L471 AbstractCegarLoop]: Abstraction has 3280 states and 3907 transitions. [2024-11-12 17:53:59,752 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-12 17:53:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3907 transitions. [2024-11-12 17:53:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 17:53:59,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:53:59,755 INFO L218 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-12 17:53:59,768 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-12 17:53:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:53:59,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:53:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:53:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 592395441, now seen corresponding path program 1 times [2024-11-12 17:53:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:53:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961785501] [2024-11-12 17:53:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:53:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:53:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,052 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-12 17:54:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:00,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961785501] [2024-11-12 17:54:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961785501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:00,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385463583] [2024-11-12 17:54:00,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:00,055 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-12 17:54:00,055 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-12 17:54:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:00,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:00,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:00,305 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-12 17:54:00,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:54:00,452 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-12 17:54:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385463583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:54:00,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:54:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-11-12 17:54:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561859941] [2024-11-12 17:54:00,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:54:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:54:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:54:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:54:00,455 INFO L87 Difference]: Start difference. First operand 3280 states and 3907 transitions. Second operand has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 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-12 17:54:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:01,176 INFO L93 Difference]: Finished difference Result 10629 states and 12813 transitions. [2024-11-12 17:54:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:54:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 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-12 17:54:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:01,206 INFO L225 Difference]: With dead ends: 10629 [2024-11-12 17:54:01,206 INFO L226 Difference]: Without dead ends: 10621 [2024-11-12 17:54:01,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-11-12 17:54:01,211 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 534 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:01,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 693 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:54:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2024-11-12 17:54:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 8614. [2024-11-12 17:54:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 7397 states have (on average 1.173043125591456) internal successors, (8677), 7420 states have internal predecessors, (8677), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2024-11-12 17:54:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 10425 transitions. [2024-11-12 17:54:01,539 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 10425 transitions. Word has length 171 [2024-11-12 17:54:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 8614 states and 10425 transitions. [2024-11-12 17:54:01,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 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-12 17:54:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 10425 transitions. [2024-11-12 17:54:01,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 17:54:01,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:01,542 INFO L218 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-12 17:54:01,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 17:54:01,743 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,SelfDestructingSolverStorable21 [2024-11-12 17:54:01,743 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:01,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash -206968297, now seen corresponding path program 1 times [2024-11-12 17:54:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230061962] [2024-11-12 17:54:01,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:01,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-12 17:54:01,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:01,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230061962] [2024-11-12 17:54:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230061962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:54:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237074078] [2024-11-12 17:54:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:01,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:54:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:54:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:54:01,836 INFO L87 Difference]: Start difference. First operand 8614 states and 10425 transitions. Second operand has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 17:54:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:02,300 INFO L93 Difference]: Finished difference Result 12954 states and 15680 transitions. [2024-11-12 17:54:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:54:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 180 [2024-11-12 17:54:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:02,325 INFO L225 Difference]: With dead ends: 12954 [2024-11-12 17:54:02,325 INFO L226 Difference]: Without dead ends: 10284 [2024-11-12 17:54:02,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:54:02,332 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 454 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:02,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 462 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:54:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10284 states. [2024-11-12 17:54:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10284 to 6689. [2024-11-12 17:54:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5754 states have (on average 1.1715328467153285) internal successors, (6741), 5772 states have internal predecessors, (6741), 532 states have call successors, (532), 328 states have call predecessors, (532), 400 states have return successors, (877), 588 states have call predecessors, (877), 532 states have call successors, (877) [2024-11-12 17:54:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 8150 transitions. [2024-11-12 17:54:02,570 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 8150 transitions. Word has length 180 [2024-11-12 17:54:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:02,570 INFO L471 AbstractCegarLoop]: Abstraction has 6689 states and 8150 transitions. [2024-11-12 17:54:02,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 17:54:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 8150 transitions. [2024-11-12 17:54:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 17:54:02,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:02,573 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 17:54:02,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 17:54:02,574 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -310206697, now seen corresponding path program 1 times [2024-11-12 17:54:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886171118] [2024-11-12 17:54:02,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-12 17:54:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886171118] [2024-11-12 17:54:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886171118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:54:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543398219] [2024-11-12 17:54:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:54:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:54:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:54:02,661 INFO L87 Difference]: Start difference. First operand 6689 states and 8150 transitions. Second operand has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 17:54:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:03,032 INFO L93 Difference]: Finished difference Result 10266 states and 12482 transitions. [2024-11-12 17:54:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:54:03,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 181 [2024-11-12 17:54:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:03,057 INFO L225 Difference]: With dead ends: 10266 [2024-11-12 17:54:03,057 INFO L226 Difference]: Without dead ends: 10265 [2024-11-12 17:54:03,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:54:03,061 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 170 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:03,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 540 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:54:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2024-11-12 17:54:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 3464. [2024-11-12 17:54:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3464 states, 2978 states have (on average 1.1655473472128945) internal successors, (3471), 2987 states have internal predecessors, (3471), 276 states have call successors, (276), 172 states have call predecessors, (276), 208 states have return successors, (449), 304 states have call predecessors, (449), 276 states have call successors, (449) [2024-11-12 17:54:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4196 transitions. [2024-11-12 17:54:03,272 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4196 transitions. Word has length 181 [2024-11-12 17:54:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:03,272 INFO L471 AbstractCegarLoop]: Abstraction has 3464 states and 4196 transitions. [2024-11-12 17:54:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 17:54:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4196 transitions. [2024-11-12 17:54:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-12 17:54:03,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:03,282 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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] [2024-11-12 17:54:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 17:54:03,283 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 674523041, now seen corresponding path program 1 times [2024-11-12 17:54:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804656381] [2024-11-12 17:54:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 17:54:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 17:54:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-12 17:54:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:54:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:54:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 17:54:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-12 17:54:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-12 17:54:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 17:54:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-12 17:54:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-12 17:54:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-12 17:54:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-12 17:54:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-12 17:54:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-12 17:54:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-12 17:54:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-12 17:54:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-12 17:54:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-12 17:54:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-12 17:54:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-12 17:54:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-12 17:54:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-12 17:54:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-11-12 17:54:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-11-12 17:54:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 169 proven. 36 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2024-11-12 17:54:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804656381] [2024-11-12 17:54:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804656381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505266166] [2024-11-12 17:54:03,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:03,421 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-12 17:54:03,423 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-12 17:54:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:03,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:54:03,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 17:54:03,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:03,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505266166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:03,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:03,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-12 17:54:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180981434] [2024-11-12 17:54:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:03,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:54:03,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:54:03,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:03,630 INFO L87 Difference]: Start difference. First operand 3464 states and 4196 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-12 17:54:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:03,817 INFO L93 Difference]: Finished difference Result 8936 states and 10862 transitions. [2024-11-12 17:54:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:54:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 437 [2024-11-12 17:54:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:03,831 INFO L225 Difference]: With dead ends: 8936 [2024-11-12 17:54:03,831 INFO L226 Difference]: Without dead ends: 5660 [2024-11-12 17:54:03,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:03,836 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 54 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 346 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-12 17:54:03,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 346 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5660 states. [2024-11-12 17:54:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5660 to 5656. [2024-11-12 17:54:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4850 states have (on average 1.1602061855670103) internal successors, (5627), 4859 states have internal predecessors, (5627), 468 states have call successors, (468), 292 states have call predecessors, (468), 336 states have return successors, (725), 504 states have call predecessors, (725), 468 states have call successors, (725) [2024-11-12 17:54:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 6820 transitions. [2024-11-12 17:54:04,066 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 6820 transitions. Word has length 437 [2024-11-12 17:54:04,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:04,066 INFO L471 AbstractCegarLoop]: Abstraction has 5656 states and 6820 transitions. [2024-11-12 17:54:04,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-12 17:54:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 6820 transitions. [2024-11-12 17:54:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-12 17:54:04,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:04,077 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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] [2024-11-12 17:54:04,091 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-12 17:54:04,278 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,SelfDestructingSolverStorable24 [2024-11-12 17:54:04,278 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash 26506275, now seen corresponding path program 1 times [2024-11-12 17:54:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758958539] [2024-11-12 17:54:04,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 17:54:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 17:54:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-12 17:54:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:54:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:54:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 17:54:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-12 17:54:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-12 17:54:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 17:54:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-12 17:54:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-12 17:54:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-12 17:54:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-12 17:54:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-12 17:54:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-12 17:54:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2024-11-12 17:54:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-12 17:54:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-12 17:54:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-11-12 17:54:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-12 17:54:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-12 17:54:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-12 17:54:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-12 17:54:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2024-11-12 17:54:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-11-12 17:54:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 169 proven. 36 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2024-11-12 17:54:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:04,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758958539] [2024-11-12 17:54:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758958539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:04,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169903356] [2024-11-12 17:54:04,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:04,423 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-12 17:54:04,425 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-12 17:54:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:04,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:54:04,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 881 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-12 17:54:04,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169903356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-12 17:54:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760514929] [2024-11-12 17:54:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:54:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:54:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:04,639 INFO L87 Difference]: Start difference. First operand 5656 states and 6820 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-12 17:54:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:04,762 INFO L93 Difference]: Finished difference Result 8972 states and 10790 transitions. [2024-11-12 17:54:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:54:04,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 437 [2024-11-12 17:54:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:04,772 INFO L225 Difference]: With dead ends: 8972 [2024-11-12 17:54:04,772 INFO L226 Difference]: Without dead ends: 3504 [2024-11-12 17:54:04,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:04,777 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 332 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-12 17:54:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 332 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2024-11-12 17:54:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3504. [2024-11-12 17:54:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 3062 states have (on average 1.1499020248203788) internal successors, (3521), 3071 states have internal predecessors, (3521), 248 states have call successors, (248), 160 states have call predecessors, (248), 192 states have return successors, (329), 272 states have call predecessors, (329), 248 states have call successors, (329) [2024-11-12 17:54:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 4098 transitions. [2024-11-12 17:54:04,910 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 4098 transitions. Word has length 437 [2024-11-12 17:54:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:04,911 INFO L471 AbstractCegarLoop]: Abstraction has 3504 states and 4098 transitions. [2024-11-12 17:54:04,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-12 17:54:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 4098 transitions. [2024-11-12 17:54:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-12 17:54:04,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:04,918 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 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, 3, 3, 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] [2024-11-12 17:54:04,931 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-12 17:54:05,118 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,SelfDestructingSolverStorable25 [2024-11-12 17:54:05,120 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1627771552, now seen corresponding path program 1 times [2024-11-12 17:54:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872914820] [2024-11-12 17:54:05,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 17:54:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 17:54:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-12 17:54:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:54:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:54:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-12 17:54:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-12 17:54:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-12 17:54:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-12 17:54:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-12 17:54:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-12 17:54:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-12 17:54:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-11-12 17:54:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-12 17:54:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-12 17:54:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-12 17:54:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-12 17:54:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-11-12 17:54:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-11-12 17:54:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2024-11-12 17:54:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-12 17:54:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2024-11-12 17:54:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-11-12 17:54:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2024-11-12 17:54:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-12 17:54:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-12 17:54:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-11-12 17:54:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2024-11-12 17:54:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 175 proven. 72 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2024-11-12 17:54:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872914820] [2024-11-12 17:54:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872914820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112203906] [2024-11-12 17:54:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:05,289 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-12 17:54:05,290 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-12 17:54:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:05,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-11-12 17:54:05,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:05,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112203906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:05,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-12 17:54:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572923976] [2024-11-12 17:54:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:54:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:05,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:54:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:05,482 INFO L87 Difference]: Start difference. First operand 3504 states and 4098 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-12 17:54:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:05,544 INFO L93 Difference]: Finished difference Result 4884 states and 5738 transitions. [2024-11-12 17:54:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:54:05,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 503 [2024-11-12 17:54:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:05,551 INFO L225 Difference]: With dead ends: 4884 [2024-11-12 17:54:05,552 INFO L226 Difference]: Without dead ends: 1568 [2024-11-12 17:54:05,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:54:05,554 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 266 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-12 17:54:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 266 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2024-11-12 17:54:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2024-11-12 17:54:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1354 states have (on average 1.1307237813884785) internal successors, (1531), 1355 states have internal predecessors, (1531), 116 states have call successors, (116), 80 states have call predecessors, (116), 96 states have return successors, (161), 132 states have call predecessors, (161), 116 states have call successors, (161) [2024-11-12 17:54:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1808 transitions. [2024-11-12 17:54:05,618 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1808 transitions. Word has length 503 [2024-11-12 17:54:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:05,619 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 1808 transitions. [2024-11-12 17:54:05,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-12 17:54:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1808 transitions. [2024-11-12 17:54:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-12 17:54:05,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:05,623 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 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-12 17:54:05,636 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-12 17:54:05,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 17:54:05,823 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:05,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -473288333, now seen corresponding path program 1 times [2024-11-12 17:54:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:05,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699458593] [2024-11-12 17:54:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 17:54:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 17:54:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 17:54:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 17:54:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 17:54:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-12 17:54:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 17:54:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-12 17:54:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-12 17:54:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-12 17:54:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-12 17:54:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-12 17:54:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-12 17:54:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-12 17:54:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-11-12 17:54:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-12 17:54:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-12 17:54:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-11-12 17:54:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-12 17:54:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-12 17:54:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-11-12 17:54:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-11-12 17:54:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-12 17:54:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2024-11-12 17:54:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2024-11-12 17:54:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-12 17:54:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2024-11-12 17:54:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2024-11-12 17:54:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-12 17:54:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-11-12 17:54:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2024-11-12 17:54:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 150 proven. 94 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2024-11-12 17:54:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699458593] [2024-11-12 17:54:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699458593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070777586] [2024-11-12 17:54:05,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:05,923 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-12 17:54:05,924 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-12 17:54:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:54:06,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2024-11-12 17:54:06,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070777586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:06,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-12 17:54:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163547359] [2024-11-12 17:54:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:54:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:54:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:54:06,131 INFO L87 Difference]: Start difference. First operand 1568 states and 1808 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-12 17:54:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:06,168 INFO L93 Difference]: Finished difference Result 2452 states and 2846 transitions. [2024-11-12 17:54:06,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:54:06,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 504 [2024-11-12 17:54:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:06,173 INFO L225 Difference]: With dead ends: 2452 [2024-11-12 17:54:06,173 INFO L226 Difference]: Without dead ends: 1020 [2024-11-12 17:54:06,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 586 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-12 17:54:06,175 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:06,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-12 17:54:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2024-11-12 17:54:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 890 states have (on average 1.1202247191011236) internal successors, (997), 891 states have internal predecessors, (997), 69 states have call successors, (69), 47 states have call predecessors, (69), 59 states have return successors, (89), 81 states have call predecessors, (89), 69 states have call successors, (89) [2024-11-12 17:54:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1155 transitions. [2024-11-12 17:54:06,212 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1155 transitions. Word has length 504 [2024-11-12 17:54:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:06,213 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1155 transitions. [2024-11-12 17:54:06,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-12 17:54:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1155 transitions. [2024-11-12 17:54:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-12 17:54:06,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:06,216 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 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, 3, 3, 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] [2024-11-12 17:54:06,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-12 17:54:06,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:06,417 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 17:54:06,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash -64461132, now seen corresponding path program 1 times [2024-11-12 17:54:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:06,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007192374] [2024-11-12 17:54:06,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 17:54:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 17:54:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-12 17:54:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:54:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 17:54:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 17:54:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-12 17:54:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-12 17:54:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-12 17:54:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-12 17:54:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-12 17:54:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-12 17:54:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-12 17:54:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-12 17:54:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-12 17:54:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2024-11-12 17:54:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-11-12 17:54:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-12 17:54:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-12 17:54:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-12 17:54:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2024-11-12 17:54:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-12 17:54:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2024-11-12 17:54:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-12 17:54:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-12 17:54:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2024-11-12 17:54:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 474 [2024-11-12 17:54:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2024-11-12 17:54:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 175 proven. 72 refuted. 0 times theorem prover too weak. 1557 trivial. 0 not checked. [2024-11-12 17:54:06,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007192374] [2024-11-12 17:54:06,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007192374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:06,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061226150] [2024-11-12 17:54:06,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:06,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:06,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:06,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-12 17:54:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:06,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:54:06,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1804 backedges. 661 proven. 0 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2024-11-12 17:54:06,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:06,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061226150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:06,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-12 17:54:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179292372] [2024-11-12 17:54:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:06,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:54:06,736 INFO L87 Difference]: Start difference. First operand 1020 states and 1155 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 17:54:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:06,774 INFO L93 Difference]: Finished difference Result 1792 states and 2045 transitions. [2024-11-12 17:54:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 507 [2024-11-12 17:54:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:06,780 INFO L225 Difference]: With dead ends: 1792 [2024-11-12 17:54:06,780 INFO L226 Difference]: Without dead ends: 908 [2024-11-12 17:54:06,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:54:06,782 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:06,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-12 17:54:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2024-11-12 17:54:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 790 states have (on average 1.120253164556962) internal successors, (885), 791 states have internal predecessors, (885), 65 states have call successors, (65), 47 states have call predecessors, (65), 51 states have return successors, (73), 69 states have call predecessors, (73), 65 states have call successors, (73) [2024-11-12 17:54:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1023 transitions. [2024-11-12 17:54:06,819 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1023 transitions. Word has length 507 [2024-11-12 17:54:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1023 transitions. [2024-11-12 17:54:06,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 17:54:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1023 transitions. [2024-11-12 17:54:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-11-12 17:54:06,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:06,823 INFO L218 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, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-12 17:54:06,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-12 17:54:07,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-12 17:54:07,024 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-12 17:54:07,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 456418422, now seen corresponding path program 1 times [2024-11-12 17:54:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:07,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720811628] [2024-11-12 17:54:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-12 17:54:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-12 17:54:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 17:54:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 17:54:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-12 17:54:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-12 17:54:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-12 17:54:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 17:54:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-12 17:54:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-11-12 17:54:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-12 17:54:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-11-12 17:54:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-12 17:54:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2024-11-12 17:54:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2024-11-12 17:54:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-11-12 17:54:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-11-12 17:54:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2024-11-12 17:54:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2024-11-12 17:54:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-12 17:54:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-12 17:54:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 434 [2024-11-12 17:54:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-12 17:54:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-11-12 17:54:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2024-11-12 17:54:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2024-11-12 17:54:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-12 17:54:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-11-12 17:54:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720811628] [2024-11-12 17:54:07,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720811628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:07,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:54:07,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:54:07,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852200684] [2024-11-12 17:54:07,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:07,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:54:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:54:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:54:07,118 INFO L87 Difference]: Start difference. First operand 908 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 17:54:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:07,254 INFO L93 Difference]: Finished difference Result 2294 states and 2603 transitions. [2024-11-12 17:54:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 519 [2024-11-12 17:54:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:07,261 INFO L225 Difference]: With dead ends: 2294 [2024-11-12 17:54:07,262 INFO L226 Difference]: Without dead ends: 890 [2024-11-12 17:54:07,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 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-12 17:54:07,263 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 108 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:07,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 409 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:54:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-12 17:54:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2024-11-12 17:54:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 772 states have (on average 1.1023316062176165) internal successors, (851), 773 states have internal predecessors, (851), 65 states have call successors, (65), 47 states have call predecessors, (65), 51 states have return successors, (73), 69 states have call predecessors, (73), 65 states have call successors, (73) [2024-11-12 17:54:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 989 transitions. [2024-11-12 17:54:07,300 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 989 transitions. Word has length 519 [2024-11-12 17:54:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:07,301 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 989 transitions. [2024-11-12 17:54:07,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 17:54:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 989 transitions. [2024-11-12 17:54:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-12 17:54:07,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:54:07,303 INFO L218 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-12 17:54:07,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 17:54:07,304 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-12 17:54:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:54:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 90815994, now seen corresponding path program 1 times [2024-11-12 17:54:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:54:07,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282332581] [2024-11-12 17:54:07,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:54:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 17:54:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:54:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:54:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:54:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 17:54:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:54:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 17:54:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 17:54:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 17:54:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 17:54:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 17:54:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 17:54:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 17:54:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 17:54:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-12 17:54:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 17:54:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-12 17:54:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-12 17:54:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-12 17:54:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-12 17:54:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-12 17:54:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-12 17:54:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-12 17:54:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-11-12 17:54:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-12 17:54:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-12 17:54:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-11-12 17:54:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-11-12 17:54:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-12 17:54:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-12 17:54:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-12 17:54:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-12 17:54:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2024-11-12 17:54:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2024-11-12 17:54:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-12 17:54:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2024-11-12 17:54:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2024-11-12 17:54:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2024-11-12 17:54:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-12 17:54:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-12 17:54:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2024-11-12 17:54:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,449 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-12 17:54:07,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:54:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282332581] [2024-11-12 17:54:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282332581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:54:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917377944] [2024-11-12 17:54:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:54:07,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:07,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:54:07,451 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:54:07,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-12 17:54:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:54:07,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:54:07,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:54:08,175 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-12 17:54:08,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:54:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917377944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:54:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:54:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-11-12 17:54:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456838389] [2024-11-12 17:54:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:54:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:54:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:54:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:54:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:54:08,177 INFO L87 Difference]: Start difference. First operand 890 states and 989 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-12 17:54:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:54:08,237 INFO L93 Difference]: Finished difference Result 1023 states and 1136 transitions. [2024-11-12 17:54:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:54:08,237 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-12 17:54:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:54:08,242 INFO L225 Difference]: With dead ends: 1023 [2024-11-12 17:54:08,242 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:54:08,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:54:08,243 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 31 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:54:08,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 460 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:54:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:54:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:54:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:54:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:54:08,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2024-11-12 17:54:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:54:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:54:08,248 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-12 17:54:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:54:08,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-12 17:54:08,250 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-12 17:54:08,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-12 17:54:08,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-12 17:54:08,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:54:08,454 INFO L421 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-12 17:54:08,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:55:11,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:55:11,602 WARN L156 FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (and (let ((.cse12 (= ~P_1_pc~0 1))) (let ((.cse9 (<= 2 ~C_1_ev~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse14 (<= ~max_loop~0 2)) (.cse8 (not .cse12)) (.cse22 (<= 0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse21 (<= 1 ~num~0)) (.cse0 (<= 1 ~i~0)) (.cse11 (= 2 ~C_1_pc~0)) (.cse24 (= ~P_1_ev~0 1)) (.cse13 (<= ~num~0 2)) (.cse15 (<= ~max_loop~0 ~i~0)) (.cse5 (<= 0 ~num~0)) (.cse23 (= ~C_1_ev~0 1)) (.cse2 (<= ~C_1_pc~0 1)) (.cse18 (= ~i~0 0)) (.cse3 (<= ~e~0 0)) (.cse16 (<= ~P_1_ev~0 0)) (.cse17 (<= ~C_1_ev~0 0)) (.cse1 (not (= |old(~P_1_st~0)| 0))) (.cse19 (= ~P_1_pc~0 0)) (.cse20 (= ~C_1_pc~0 0)) (.cse7 (= ~num~0 0)) (.cse6 (not (= |old(~C_1_st~0)| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse6) (and .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse3 .cse13 .cse14 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse3 .cse13 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse3 .cse14 .cse16 (<= ~i~0 1) .cse17 (<= ~num~0 1) .cse5 .cse6) (and .cse18 .cse3 .cse14 .cse16 .cse17 .cse19 .cse20 .cse7) (and .cse1 .cse20 .cse4 .cse8 .cse21 .cse6) (and .cse1 .cse3 .cse22 .cse20 .cse4 .cse21 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse3 .cse24 .cse13 .cse14 .cse5 .cse23 .cse6) (and .cse1 .cse18 .cse3 .cse19 .cse20 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse21 .cse6) (and .cse1 .cse20 .cse4 .cse7 .cse8 .cse6) (and .cse3 .cse22 .cse20 .cse4 .cse23 .cse21 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse3 .cse24 .cse13 .cse15 .cse5 .cse23 .cse6) (and .cse1 .cse2 .cse3 .cse19 .cse7 .cse6) (and .cse18 .cse3 .cse16 .cse17 .cse19 .cse20 .cse7 .cse6) (and .cse1 .cse19 .cse20 .cse7 .cse6)))) (= ~C_1_st~0 |old(~C_1_st~0)|) (= |old(~P_1_st~0)| ~P_1_st~0)) Eliminated clause: (let ((.cse15 (= ~P_1_pc~0 1))) (let ((.cse12 (<= ~P_1_ev~0 0)) (.cse13 (<= ~C_1_ev~0 0)) (.cse18 (<= 2 ~C_1_ev~0)) (.cse19 (<= 2 ~P_1_ev~0)) (.cse21 (<= ~max_loop~0 ~i~0)) (.cse22 (<= 0 ~i~0)) (.cse9 (<= 1 ~num~0)) (.cse8 (not .cse15)) (.cse14 (= 2 ~C_1_pc~0)) (.cse23 (= ~P_1_ev~0 1)) (.cse20 (<= ~num~0 2)) (.cse11 (<= ~max_loop~0 2)) (.cse24 (= ~C_1_ev~0 1)) (.cse10 (= ~i~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse17 (<= 1 ~i~0)) (.cse5 (<= ~C_1_pc~0 1)) (.cse6 (<= ~e~0 0)) (.cse7 (<= 1 ~P_1_pc~0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse16 (<= 0 ~num~0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse3 .cse4) (and .cse1 .cse7 .cse8 .cse3 .cse9 .cse4) (and .cse1 .cse7 .cse2 .cse8 .cse3 .cse4) (and .cse10 .cse6 .cse11 .cse12 .cse13 .cse0 .cse1 .cse2) (and .cse14 .cse15 .cse6 .cse11 .cse12 .cse13 (= ~i~0 1) (<= ~num~0 1) .cse3 .cse16 .cse4) (and .cse17 .cse18 .cse19 .cse14 .cse15 .cse6 .cse20 .cse11 .cse3 .cse16 .cse4) (and .cse10 .cse6 .cse12 .cse13 .cse0 .cse1 .cse2 .cse3) (and .cse17 .cse18 .cse19 .cse14 .cse15 .cse6 .cse20 .cse21 .cse3 .cse16 .cse4) (and .cse6 .cse22 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse17 .cse14 .cse15 .cse6 .cse23 .cse20 .cse21 .cse3 .cse16 .cse24 .cse4) (and .cse17 .cse5 .cse6 .cse7 .cse3 .cse16 .cse24) (and .cse6 .cse22 .cse1 .cse7 .cse3 .cse24 .cse9) (and .cse5 .cse6 .cse7 .cse2 .cse8 .cse3 .cse4) (and .cse17 .cse14 .cse15 .cse6 .cse23 .cse20 .cse11 .cse3 .cse16 .cse24 .cse4) (and .cse10 .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse17 .cse5 .cse6 .cse7 .cse3 .cse16 .cse4)))) [2024-11-12 17:55:11,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:55:11 BoogieIcfgContainer [2024-11-12 17:55:11,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:55:11,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:55:11,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:55:11,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:55:11,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:53:45" (3/4) ... [2024-11-12 17:55:11,818 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-11-12 17:55:11,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-12 17:55:11,829 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-12 17:55:11,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 17:55:11,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:55:11,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:55:11,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:55:11,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:55:11,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:55:11,932 INFO L158 Benchmark]: Toolchain (without parser) took 87255.09ms. Allocated memory was 188.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 120.2MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. [2024-11-12 17:55:11,932 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 115.3MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:55:11,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.82ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 104.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 17:55:11,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 188.7MB. Free memory was 104.9MB in the beginning and 102.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:11,932 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 188.7MB. Free memory was 102.7MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:55:11,932 INFO L158 Benchmark]: RCFGBuilder took 425.01ms. Allocated memory is still 188.7MB. Free memory was 100.2MB in the beginning and 139.5MB in the end (delta: -39.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:55:11,933 INFO L158 Benchmark]: TraceAbstraction took 86368.37ms. Allocated memory was 188.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 138.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-12 17:55:11,933 INFO L158 Benchmark]: Witness Printer took 115.76ms. Allocated memory is still 2.6GB. 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-12 17:55:11,934 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 115.3MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.82ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 104.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 188.7MB. Free memory was 104.9MB in the beginning and 102.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 188.7MB. Free memory was 102.7MB in the beginning and 100.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.01ms. Allocated memory is still 188.7MB. Free memory was 100.2MB in the beginning and 139.5MB in the end (delta: -39.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 86368.37ms. Allocated memory was 188.7MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 138.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 115.76ms. Allocated memory is still 2.6GB. 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.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: 23.0s, OverallIterations: 31, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5934 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5785 mSDsluCounter, 14295 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8452 mSDsCounter, 663 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2789 IncrementalHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 663 mSolverCounterUnsat, 5843 mSDtfsCounter, 2789 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5878 GetRequests, 5700 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8614occurred in iteration=22, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 14021 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 10495 NumberOfCodeBlocks, 10495 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 10618 ConstructedInterpolants, 0 QuantifiedInterpolants, 16949 SizeOfPredicates, 2 NumberOfNonLiveVariables, 11270 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 48 InterpolantComputations, 30 PerfectInterpolantSequences, 24115/24615 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: ((((((((((((((i == 0) && (e <= 0)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0)) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (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)) && (0 <= num)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (0 <= num)) && (P_1_st != 0))) || (((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (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)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || ((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num))) - 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)) || (((((C_1_pc == 0) && (C_1_st != 0)) && (1 <= num)) && (2 <= P_1_pc)) && (P_1_st != 0))) || (((((C_1_pc == 0) && (num == 0)) && (C_1_st != 0)) && (2 <= P_1_pc)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_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)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (P_1_st == 0)) && (max_loop <= i)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (2 <= P_1_pc)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (P_1_st == 0)) && (max_loop <= 2)) && (i == 1)) && (0 <= num))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (C_1_st != 0)) && (1 <= num)) && (2 <= P_1_pc)) && (P_1_st != 0))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num))) || ((((((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)) || (((((((((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)) && (0 <= num))) || (((((C_1_pc == 0) && (C_1_st != 0)) && (1 <= num)) && (2 <= P_1_pc)) && (P_1_st != 0))) || (((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (0 <= num))) || (((((C_1_pc == 0) && (num == 0)) && (C_1_st != 0)) && (2 <= P_1_pc)) && (P_1_st != 0))) || (((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && (C_1_st != 0)) && (2 <= P_1_pc)) && (P_1_st != 0))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || ((((((((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))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (C_1_st != 0)) && (1 <= num)) && (2 <= P_1_pc)) && (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: ((((((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (C_1_ev == 1)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (C_1_ev == 1))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (C_1_ev == 1)) && (1 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (C_1_ev == 1)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) Ensures: (((((((((((((\old(P_1_st) == 0) || (P_1_pc != 0)) || (P_1_st != 0)) && ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) || (C_1_pc < 2)) || (P_1_ev < 2))) && (((((1 < i) || (0 < P_1_ev)) || (0 < C_1_ev)) || (num != 1)) || (P_1_st != 0))) && ((((((((((((((((((((((((1 <= i) && (\old(P_1_st) != 0)) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (0 <= num)) && (\old(C_1_st) != 0)) || (((((((((((\old(P_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 <= 1)) && (0 <= num)) && (\old(C_1_st) != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (\old(P_1_st) != 0)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (0 <= num)) && (\old(C_1_st) != 0))) || (((((\old(P_1_st) != 0) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0))) || (((((((\old(P_1_st) != 0) && (e <= 0)) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (1 <= num)) && (\old(C_1_st) != 0))) || (((((\old(P_1_st) != 0) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (1 <= num))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (0 <= num)) && (C_1_ev == 1)) && (\old(C_1_st) != 0))) || (((((((((((1 <= i) && (\old(P_1_st) != 0)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (num <= 2)) && (max_loop <= 2)) && (0 <= num)) && (C_1_ev == 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) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_ev == 1)) && (1 <= num)) && (\old(C_1_st) != 0))) || (((((((((((1 <= i) && (\old(P_1_st) != 0)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (num <= 2)) && (max_loop <= i)) && (0 <= num)) && (C_1_ev == 1)) && (\old(C_1_st) != 0))) || ((((((\old(P_1_st) != 0) && (C_1_pc <= 1)) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (\old(C_1_st) != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (\old(P_1_st) != 0)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (1 <= P_1_pc)) && (0 <= num)) && (\old(C_1_st) != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (\old(C_1_st) != 0))) || (((((\old(P_1_st) != 0) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (1 <= num))) || (((((\old(P_1_st) != 0) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (\old(C_1_st) != 0)))) && ((\old(P_1_st) != 0) || (C_1_st == \old(C_1_st)))) && ((((P_1_pc == 1) || (\old(P_1_st) == 0)) || (P_1_pc < 1)) || (P_1_st != 0))) && (((C_1_pc < 2) || (P_1_st == 0)) || (C_1_ev != 1))) && ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) || (1 < C_1_pc)) || ((P_1_st == 0) && (C_1_st != 0)))) && ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) || (C_1_pc < 2)) || (0 < C_1_ev))) && (((P_1_pc == 1) || ((C_1_pc <= 1) && (C_1_st != 0))) || (P_1_pc < 1))) && ((((((((((((((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 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (0 <= num))) || ((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || (((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_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))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) Ensures: (((((((0 < \result) || (num < 1)) || (C_1_st != 0)) && ((((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (0 <= num))) || ((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || (((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_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))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0)))) && (((0 < \result) || (C_1_pc < 2)) || (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)) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) Ensures: (((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (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)) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) Ensures: ((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((e <= 0) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num)) && (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) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (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) && (0 <= i)) && (C_1_pc == 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (1 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (P_1_pc != 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((C_1_pc == 0) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 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 <= 1)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= i)) && (C_1_st != 0)) && (0 <= num)) && (P_1_st != 0))) || ((((((1 <= i) && (C_1_pc <= 1)) && (e <= 0)) && (1 <= P_1_pc)) && (C_1_st != 0)) && (0 <= num))) || (((((((C_1_pc <= 1) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && (P_1_pc != 1)) && (C_1_st != 0)) && (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: ((0 < P_1_pc) || (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-12 17:55:11,968 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