./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:59:47,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:59:47,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:59:47,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:59:47,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:59:47,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:59:47,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:59:47,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:59:47,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:59:47,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:59:47,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:59:47,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:59:47,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:59:47,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:59:47,871 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:59:47,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:59:47,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:59:47,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:59:47,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:59:47,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:59:47,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:59:47,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:59:47,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:59:47,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:59:47,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:59:47,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:59:47,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:59:47,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:59:47,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:59:47,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:59:47,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:59:47,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:59:47,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:59:47,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:59:47,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:59:47,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:59:47,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:59:47,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:59:47,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:59:47,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:59:47,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:59:47,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:59:47,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:59:47,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:59:47,880 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-clean/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-clean/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 -> aad83614f5b3454ec30b386336992d9fee88422d967149e7e88efe6256830f00 [2024-10-11 20:59:48,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:59:48,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:59:48,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:59:48,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:59:48,152 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:59:48,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2024-10-11 20:59:49,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:59:49,789 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:59:49,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound5.c [2024-10-11 20:59:49,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bda968627/8df95f41e0cb41bab234ea56508f5b29/FLAG4fa4e60ed [2024-10-11 20:59:49,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bda968627/8df95f41e0cb41bab234ea56508f5b29 [2024-10-11 20:59:49,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:59:49,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:59:49,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:59:49,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:59:49,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:59:49,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:59:49" (1/1) ... [2024-10-11 20:59:49,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504b0d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:49, skipping insertion in model container [2024-10-11 20:59:49,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:59:49" (1/1) ... [2024-10-11 20:59:49,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:59:50,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:59:50,045 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:59:50,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:59:50,081 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:59:50,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50 WrapperNode [2024-10-11 20:59:50,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:59:50,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:59:50,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:59:50,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:59:50,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,118 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-11 20:59:50,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:59:50,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:59:50,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:59:50,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:59:50,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,141 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-10-11 20:59:50,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:59:50,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:59:50,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:59:50,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:59:50,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (1/1) ... [2024-10-11 20:59:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:59:50,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:50,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:59:50,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:59:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:59:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:59:50,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:59:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:59:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:59:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:59:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:59:50,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:59:50,315 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:59:50,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:59:50,655 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-11 20:59:50,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:59:50,691 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:59:50,692 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 20:59:50,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:50 BoogieIcfgContainer [2024-10-11 20:59:50,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:59:50,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:59:50,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:59:50,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:59:50,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:59:49" (1/3) ... [2024-10-11 20:59:50,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca257c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:50, skipping insertion in model container [2024-10-11 20:59:50,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:59:50" (2/3) ... [2024-10-11 20:59:50,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca257c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:50, skipping insertion in model container [2024-10-11 20:59:50,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:50" (3/3) ... [2024-10-11 20:59:50,702 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2024-10-11 20:59:50,719 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:59:50,720 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 20:59:50,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:59:50,789 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;@75517930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:59:50,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 20:59:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:59:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:59:50,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:50,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:50,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:50,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1616721719, now seen corresponding path program 1 times [2024-10-11 20:59:50,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563289489] [2024-10-11 20:59:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:50,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563289489] [2024-10-11 20:59:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563289489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:59:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981466579] [2024-10-11 20:59:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:50,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:59:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:59:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:59:51,026 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.8) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:59:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:51,057 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-10-11 20:59:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:59:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:59:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:51,065 INFO L225 Difference]: With dead ends: 126 [2024-10-11 20:59:51,065 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 20:59:51,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:59:51,071 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:51,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 20:59:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 20:59:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 55 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:59:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-10-11 20:59:51,112 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2024-10-11 20:59:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:51,113 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-10-11 20:59:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:59:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-10-11 20:59:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:59:51,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:51,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:51,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:59:51,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:51,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1919924458, now seen corresponding path program 1 times [2024-10-11 20:59:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179238619] [2024-10-11 20:59:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179238619] [2024-10-11 20:59:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179238619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786619541] [2024-10-11 20:59:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:51,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:51,276 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:51,340 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-11 20:59:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:59:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-10-11 20:59:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:51,342 INFO L225 Difference]: With dead ends: 75 [2024-10-11 20:59:51,343 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 20:59:51,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:59:51,345 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:51,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 20:59:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 20:59:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.631578947368421) internal successors, (62), 59 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:59:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-11 20:59:51,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2024-10-11 20:59:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-11 20:59:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-11 20:59:51,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:59:51,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:51,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:51,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:59:51,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -390003592, now seen corresponding path program 1 times [2024-10-11 20:59:51,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:51,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286574151] [2024-10-11 20:59:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:59:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860696759] [2024-10-11 20:59:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:51,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:51,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:51,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:59:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:59:51,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:51,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:51,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286574151] [2024-10-11 20:59:51,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:59:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860696759] [2024-10-11 20:59:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860696759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:59:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691732886] [2024-10-11 20:59:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:59:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:59:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:59:51,509 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:51,589 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-10-11 20:59:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:59:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-10-11 20:59:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:51,591 INFO L225 Difference]: With dead ends: 104 [2024-10-11 20:59:51,591 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 20:59:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:59:51,593 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 20:59:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-10-11 20:59:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.65) internal successors, (99), 81 states have internal predecessors, (99), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:59:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-10-11 20:59:51,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 17 [2024-10-11 20:59:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:51,605 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-10-11 20:59:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-10-11 20:59:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:59:51,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:51,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:51,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:59:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:51,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1131295462, now seen corresponding path program 1 times [2024-10-11 20:59:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634658632] [2024-10-11 20:59:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:51,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634658632] [2024-10-11 20:59:51,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634658632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:51,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:51,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:51,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617966815] [2024-10-11 20:59:51,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:51,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:51,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:51,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:51,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:51,939 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:52,179 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2024-10-11 20:59:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:52,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-11 20:59:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:52,181 INFO L225 Difference]: With dead ends: 138 [2024-10-11 20:59:52,181 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 20:59:52,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:52,182 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:52,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 20:59:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-11 20:59:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 115 states have internal predecessors, (150), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:59:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2024-10-11 20:59:52,195 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 19 [2024-10-11 20:59:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:52,196 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2024-10-11 20:59:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2024-10-11 20:59:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:59:52,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:52,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:59:52,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -710420897, now seen corresponding path program 1 times [2024-10-11 20:59:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984974781] [2024-10-11 20:59:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984974781] [2024-10-11 20:59:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984974781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23998866] [2024-10-11 20:59:52,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:52,324 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:52,530 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-10-11 20:59:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:52,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-11 20:59:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:52,534 INFO L225 Difference]: With dead ends: 135 [2024-10-11 20:59:52,535 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 20:59:52,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:52,537 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:52,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 96 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 20:59:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2024-10-11 20:59:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5666666666666667) internal successors, (141), 111 states have internal predecessors, (141), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:59:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2024-10-11 20:59:52,564 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 20 [2024-10-11 20:59:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2024-10-11 20:59:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2024-10-11 20:59:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:59:52,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:52,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:52,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:59:52,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -548211268, now seen corresponding path program 1 times [2024-10-11 20:59:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620790649] [2024-10-11 20:59:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:59:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620790649] [2024-10-11 20:59:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620790649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:52,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615226399] [2024-10-11 20:59:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:52,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:52,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:59:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:52,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:59:52,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:52,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615226399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:52,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-11 20:59:52,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414626054] [2024-10-11 20:59:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:52,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:52,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:52,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:52,913 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:53,022 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2024-10-11 20:59:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 20:59:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:53,024 INFO L225 Difference]: With dead ends: 123 [2024-10-11 20:59:53,025 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 20:59:53,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:59:53,026 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 81 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:53,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 72 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 20:59:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-10-11 20:59:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 111 states have internal predecessors, (140), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:59:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2024-10-11 20:59:53,047 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 21 [2024-10-11 20:59:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-10-11 20:59:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2024-10-11 20:59:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:59:53,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:53,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:53,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:59:53,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:53,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:53,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash 185319937, now seen corresponding path program 1 times [2024-10-11 20:59:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244769800] [2024-10-11 20:59:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:59:53,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486113778] [2024-10-11 20:59:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:53,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:53,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:59:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:59:53,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:53,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:53,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:53,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244769800] [2024-10-11 20:59:53,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:59:53,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486113778] [2024-10-11 20:59:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486113778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:53,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101611048] [2024-10-11 20:59:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:53,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:53,417 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:53,541 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2024-10-11 20:59:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 20:59:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:53,543 INFO L225 Difference]: With dead ends: 121 [2024-10-11 20:59:53,543 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 20:59:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:59:53,544 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 74 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:53,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 77 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 20:59:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 20:59:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 111 states have internal predecessors, (139), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:59:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-10-11 20:59:53,554 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 22 [2024-10-11 20:59:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-10-11 20:59:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:59:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-10-11 20:59:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:59:53,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:53,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:53,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:59:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:53,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1256432811, now seen corresponding path program 1 times [2024-10-11 20:59:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775291076] [2024-10-11 20:59:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:59:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775291076] [2024-10-11 20:59:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775291076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356678967] [2024-10-11 20:59:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:53,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:53,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:59:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:53,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:59:53,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:59:54,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:59:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356678967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:54,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 20:59:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110763840] [2024-10-11 20:59:54,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:54,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:59:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:59:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:54,138 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 20:59:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:54,252 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2024-10-11 20:59:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:59:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-11 20:59:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:54,256 INFO L225 Difference]: With dead ends: 191 [2024-10-11 20:59:54,256 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 20:59:54,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:59:54,257 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:54,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 239 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 20:59:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2024-10-11 20:59:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.548148148148148) internal successors, (209), 156 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:59:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2024-10-11 20:59:54,283 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 34 [2024-10-11 20:59:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:54,283 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2024-10-11 20:59:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 20:59:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2024-10-11 20:59:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:59:54,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:54,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:54,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:59:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:59:54,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash -294711385, now seen corresponding path program 1 times [2024-10-11 20:59:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548994997] [2024-10-11 20:59:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:54,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:54,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548994997] [2024-10-11 20:59:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548994997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:54,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438862705] [2024-10-11 20:59:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:54,557 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:54,596 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2024-10-11 20:59:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-11 20:59:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:54,598 INFO L225 Difference]: With dead ends: 177 [2024-10-11 20:59:54,599 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 20:59:54,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:59:54,600 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:54,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 20:59:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-10-11 20:59:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.511111111111111) internal successors, (204), 154 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:59:54,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2024-10-11 20:59:54,618 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 35 [2024-10-11 20:59:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:54,618 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2024-10-11 20:59:54,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2024-10-11 20:59:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:59:54,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:54,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:59:54,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:54,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash 250201833, now seen corresponding path program 1 times [2024-10-11 20:59:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:54,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325780761] [2024-10-11 20:59:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325780761] [2024-10-11 20:59:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325780761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960964801] [2024-10-11 20:59:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:54,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:54,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:59:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:54,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:59:54,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:54,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:54,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960964801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:59:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741724666] [2024-10-11 20:59:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:59:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:54,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:59:54,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:59:54,842 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:54,867 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2024-10-11 20:59:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:59:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 20:59:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:54,872 INFO L225 Difference]: With dead ends: 165 [2024-10-11 20:59:54,872 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 20:59:54,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:59:54,873 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:54,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 20:59:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-11 20:59:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 135 states have (on average 1.474074074074074) internal successors, (199), 153 states have internal predecessors, (199), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:59:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2024-10-11 20:59:54,885 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 37 [2024-10-11 20:59:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:54,885 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2024-10-11 20:59:54,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2024-10-11 20:59:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:59:54,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:54,889 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:54,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:59:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:59:55,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -833677725, now seen corresponding path program 1 times [2024-10-11 20:59:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935900371] [2024-10-11 20:59:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935900371] [2024-10-11 20:59:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935900371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630194932] [2024-10-11 20:59:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:55,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:55,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:59:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:59:55,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:55,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630194932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:59:55,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545826270] [2024-10-11 20:59:55,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:55,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:59:55,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:59:55,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:59:55,317 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:55,366 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2024-10-11 20:59:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:59:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 20:59:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:55,368 INFO L225 Difference]: With dead ends: 174 [2024-10-11 20:59:55,368 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 20:59:55,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:59:55,370 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:55,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 20:59:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2024-10-11 20:59:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 152 states have internal predecessors, (194), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:59:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2024-10-11 20:59:55,380 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 38 [2024-10-11 20:59:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:55,381 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2024-10-11 20:59:55,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2024-10-11 20:59:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:59:55,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:55,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:55,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:59:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:59:55,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -260192512, now seen corresponding path program 1 times [2024-10-11 20:59:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581827100] [2024-10-11 20:59:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581827100] [2024-10-11 20:59:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581827100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724179823] [2024-10-11 20:59:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:55,681 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:55,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:59:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:55,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:59:55,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:55,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724179823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:59:55,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:59:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-11 20:59:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805496143] [2024-10-11 20:59:55,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:59:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:59:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:59:55,888 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 20:59:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:56,005 INFO L93 Difference]: Finished difference Result 305 states and 362 transitions. [2024-10-11 20:59:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:59:56,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 40 [2024-10-11 20:59:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:56,008 INFO L225 Difference]: With dead ends: 305 [2024-10-11 20:59:56,008 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 20:59:56,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:59:56,010 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:56,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 314 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:59:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 20:59:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 251. [2024-10-11 20:59:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 217 states have (on average 1.4101382488479262) internal successors, (306), 234 states have internal predecessors, (306), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:59:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 328 transitions. [2024-10-11 20:59:56,025 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 328 transitions. Word has length 40 [2024-10-11 20:59:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:56,025 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 328 transitions. [2024-10-11 20:59:56,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 20:59:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 328 transitions. [2024-10-11 20:59:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 20:59:56,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:56,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:59:56,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:59:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:56,229 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash -260192497, now seen corresponding path program 1 times [2024-10-11 20:59:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441116490] [2024-10-11 20:59:56,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:59:56,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827763367] [2024-10-11 20:59:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:56,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:56,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:59:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:56,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:59:56,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:56,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441116490] [2024-10-11 20:59:56,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:59:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827763367] [2024-10-11 20:59:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827763367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:56,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-11 20:59:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58234160] [2024-10-11 20:59:56,599 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:59:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:59:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:56,600 INFO L87 Difference]: Start difference. First operand 251 states and 328 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:56,727 INFO L93 Difference]: Finished difference Result 258 states and 331 transitions. [2024-10-11 20:59:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:59:56,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-10-11 20:59:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:56,729 INFO L225 Difference]: With dead ends: 258 [2024-10-11 20:59:56,729 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 20:59:56,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:59:56,730 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:56,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 77 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 20:59:56,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2024-10-11 20:59:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 230 states have internal predecessors, (285), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:59:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2024-10-11 20:59:56,743 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 40 [2024-10-11 20:59:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2024-10-11 20:59:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2024-10-11 20:59:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:59:56,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:56,744 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:59:56,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:59:56,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:59:56,945 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:56,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 523967238, now seen corresponding path program 1 times [2024-10-11 20:59:56,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540186745] [2024-10-11 20:59:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:59:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234909499] [2024-10-11 20:59:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:56,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:56,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:59:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:57,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:59:57,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:57,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:57,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:57,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540186745] [2024-10-11 20:59:57,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:59:57,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234909499] [2024-10-11 20:59:57,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234909499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:57,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:57,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-11 20:59:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611884480] [2024-10-11 20:59:57,535 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:57,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:59:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:59:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:57,536 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:57,722 INFO L93 Difference]: Finished difference Result 335 states and 415 transitions. [2024-10-11 20:59:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:59:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-10-11 20:59:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:57,725 INFO L225 Difference]: With dead ends: 335 [2024-10-11 20:59:57,725 INFO L226 Difference]: Without dead ends: 330 [2024-10-11 20:59:57,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:59:57,726 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 92 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:57,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 116 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:59:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-11 20:59:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2024-10-11 20:59:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 294 states have internal predecessors, (363), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:59:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2024-10-11 20:59:57,744 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 41 [2024-10-11 20:59:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:57,744 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2024-10-11 20:59:57,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2024-10-11 20:59:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:59:57,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:57,745 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:59:57,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:59:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:57,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1247688999, now seen corresponding path program 1 times [2024-10-11 20:59:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877716819] [2024-10-11 20:59:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:58,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877716819] [2024-10-11 20:59:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877716819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018235159] [2024-10-11 20:59:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:58,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:58,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:58,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:58,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:59:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:59:58,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:58,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:59:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018235159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:59:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-11 20:59:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288244916] [2024-10-11 20:59:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:59:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:59:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:59:58,184 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:58,301 INFO L93 Difference]: Finished difference Result 314 states and 391 transitions. [2024-10-11 20:59:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:59:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-10-11 20:59:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:58,304 INFO L225 Difference]: With dead ends: 314 [2024-10-11 20:59:58,304 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 20:59:58,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:59:58,306 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:58,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 75 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:59:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 20:59:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2024-10-11 20:59:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 289 states have internal predecessors, (356), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:59:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 384 transitions. [2024-10-11 20:59:58,324 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 384 transitions. Word has length 42 [2024-10-11 20:59:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:58,325 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 384 transitions. [2024-10-11 20:59:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:59:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 384 transitions. [2024-10-11 20:59:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:59:58,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:58,326 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:59:58,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:59:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:59:58,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash 23653362, now seen corresponding path program 1 times [2024-10-11 20:59:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913649507] [2024-10-11 20:59:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:59:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913649507] [2024-10-11 20:59:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913649507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343706095] [2024-10-11 20:59:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:59:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:59:58,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:59:58,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:59:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:58,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:59:58,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:59:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:58,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:59:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343706095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:59:58,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:59:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2024-10-11 20:59:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052065309] [2024-10-11 20:59:58,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:59:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:59:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:59:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:59:59,001 INFO L87 Difference]: Start difference. First operand 309 states and 384 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:59:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:59:59,531 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2024-10-11 20:59:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:59:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-10-11 20:59:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:59:59,533 INFO L225 Difference]: With dead ends: 332 [2024-10-11 20:59:59,534 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 20:59:59,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:59:59,535 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 140 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:59:59,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 186 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:59:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 20:59:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2024-10-11 20:59:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.2134831460674158) internal successors, (324), 278 states have internal predecessors, (324), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:59:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 352 transitions. [2024-10-11 20:59:59,549 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 352 transitions. Word has length 43 [2024-10-11 20:59:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:59:59,549 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 352 transitions. [2024-10-11 20:59:59,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:59:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 352 transitions. [2024-10-11 20:59:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:59:59,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:59:59,550 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 20:59:59,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:59:59,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:59:59,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 20:59:59,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:59:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 733254281, now seen corresponding path program 1 times [2024-10-11 20:59:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:59:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959201177] [2024-10-11 20:59:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:59:59,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:59:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:59:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:59:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:59:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:59:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:59:59,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:59:59,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959201177] [2024-10-11 20:59:59,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959201177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:59:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:59:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:59:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127739854] [2024-10-11 20:59:59,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:59:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:59:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:59:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:59:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:59:59,812 INFO L87 Difference]: Start difference. First operand 297 states and 352 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:00:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:00,008 INFO L93 Difference]: Finished difference Result 298 states and 352 transitions. [2024-10-11 21:00:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:00:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-10-11 21:00:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:00,012 INFO L225 Difference]: With dead ends: 298 [2024-10-11 21:00:00,026 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 21:00:00,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:00:00,027 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:00,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:00:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 21:00:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-10-11 21:00:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 267 states have (on average 1.1910112359550562) internal successors, (318), 278 states have internal predecessors, (318), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 21:00:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 346 transitions. [2024-10-11 21:00:00,045 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 346 transitions. Word has length 44 [2024-10-11 21:00:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 346 transitions. [2024-10-11 21:00:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:00:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 346 transitions. [2024-10-11 21:00:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 21:00:00,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:00,046 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:00:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:00:00,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1596888275, now seen corresponding path program 1 times [2024-10-11 21:00:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331877379] [2024-10-11 21:00:00,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:00,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:00:00,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:00,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331877379] [2024-10-11 21:00:00,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331877379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:00,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901941763] [2024-10-11 21:00:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:00,195 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:00,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 21:00:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:00,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:00:00,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:00:00,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:00:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901941763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:00,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-11 21:00:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368935840] [2024-10-11 21:00:00,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 21:00:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 21:00:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:00:00,590 INFO L87 Difference]: Start difference. First operand 297 states and 346 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:00:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:01,152 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2024-10-11 21:00:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:00:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-10-11 21:00:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:01,154 INFO L225 Difference]: With dead ends: 302 [2024-10-11 21:00:01,154 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 21:00:01,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2024-10-11 21:00:01,156 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 183 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:01,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 169 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:00:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 21:00:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 294. [2024-10-11 21:00:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 267 states have (on average 1.149812734082397) internal successors, (307), 275 states have internal predecessors, (307), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 21:00:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 335 transitions. [2024-10-11 21:00:01,174 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 335 transitions. Word has length 44 [2024-10-11 21:00:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:01,174 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 335 transitions. [2024-10-11 21:00:01,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:00:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 335 transitions. [2024-10-11 21:00:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 21:00:01,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:01,175 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:00:01,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 21:00:01,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:00:01,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2036070966, now seen corresponding path program 1 times [2024-10-11 21:00:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746277243] [2024-10-11 21:00:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:00:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482814428] [2024-10-11 21:00:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:01,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:01,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:01,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:01,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 21:00:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:01,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 21:00:01,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:00:01,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:00:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746277243] [2024-10-11 21:00:01,791 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:00:01,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482814428] [2024-10-11 21:00:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482814428] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:01,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:00:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-11 21:00:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791251979] [2024-10-11 21:00:01,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:01,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 21:00:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 21:00:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:00:01,792 INFO L87 Difference]: Start difference. First operand 294 states and 335 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 21:00:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:02,250 INFO L93 Difference]: Finished difference Result 394 states and 449 transitions. [2024-10-11 21:00:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:00:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-10-11 21:00:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:02,253 INFO L225 Difference]: With dead ends: 394 [2024-10-11 21:00:02,253 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 21:00:02,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-11 21:00:02,254 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 86 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:02,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 135 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:00:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 21:00:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2024-10-11 21:00:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 247 states have (on average 1.1093117408906883) internal successors, (274), 254 states have internal predecessors, (274), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 21:00:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 300 transitions. [2024-10-11 21:00:02,269 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 300 transitions. Word has length 45 [2024-10-11 21:00:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:02,269 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 300 transitions. [2024-10-11 21:00:02,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 21:00:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 300 transitions. [2024-10-11 21:00:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 21:00:02,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:02,270 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:00:02,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 21:00:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:02,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1171212445, now seen corresponding path program 2 times [2024-10-11 21:00:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918444787] [2024-10-11 21:00:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:00:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549574861] [2024-10-11 21:00:02,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:00:02,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:02,484 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:02,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 21:00:02,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:00:02,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:00:02,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 21:00:02,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:00:02,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:00:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:02,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918444787] [2024-10-11 21:00:02,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:00:02,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549574861] [2024-10-11 21:00:02,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549574861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:02,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:00:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 21:00:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729391842] [2024-10-11 21:00:02,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:00:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:00:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:00:02,998 INFO L87 Difference]: Start difference. First operand 272 states and 300 transitions. Second operand has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:00:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:03,880 INFO L93 Difference]: Finished difference Result 441 states and 506 transitions. [2024-10-11 21:00:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 21:00:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2024-10-11 21:00:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:03,886 INFO L225 Difference]: With dead ends: 441 [2024-10-11 21:00:03,886 INFO L226 Difference]: Without dead ends: 428 [2024-10-11 21:00:03,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:00:03,887 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 208 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:03,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 253 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:00:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-11 21:00:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 390. [2024-10-11 21:00:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 359 states have (on average 1.128133704735376) internal successors, (405), 366 states have internal predecessors, (405), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 21:00:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 443 transitions. [2024-10-11 21:00:03,913 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 443 transitions. Word has length 64 [2024-10-11 21:00:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:03,914 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 443 transitions. [2024-10-11 21:00:03,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 21:00:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 443 transitions. [2024-10-11 21:00:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:00:03,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:03,915 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:03,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 21:00:04,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:04,120 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:04,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:04,120 INFO L85 PathProgramCache]: Analyzing trace with hash 397103473, now seen corresponding path program 1 times [2024-10-11 21:00:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:04,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530403291] [2024-10-11 21:00:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:04,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:00:04,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:04,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530403291] [2024-10-11 21:00:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530403291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:04,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72564136] [2024-10-11 21:00:04,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:04,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:04,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:04,197 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:04,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 21:00:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:04,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:00:04,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:00:04,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:00:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72564136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:04,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-11 21:00:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501877166] [2024-10-11 21:00:04,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:04,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:00:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:00:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:00:04,427 INFO L87 Difference]: Start difference. First operand 390 states and 443 transitions. Second operand has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 21:00:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:04,620 INFO L93 Difference]: Finished difference Result 1011 states and 1242 transitions. [2024-10-11 21:00:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:00:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 76 [2024-10-11 21:00:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:04,625 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 21:00:04,626 INFO L226 Difference]: Without dead ends: 1009 [2024-10-11 21:00:04,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:00:04,627 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:04,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 175 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:00:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-11 21:00:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2024-10-11 21:00:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 926 states have (on average 1.1339092872570193) internal successors, (1050), 931 states have internal predecessors, (1050), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 21:00:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1154 transitions. [2024-10-11 21:00:04,684 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1154 transitions. Word has length 76 [2024-10-11 21:00:04,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:04,685 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1154 transitions. [2024-10-11 21:00:04,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 15.5) internal successors, (124), 9 states have internal predecessors, (124), 8 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 21:00:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1154 transitions. [2024-10-11 21:00:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 21:00:04,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:04,686 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:04,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 21:00:04,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:04,887 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 267410460, now seen corresponding path program 1 times [2024-10-11 21:00:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318526715] [2024-10-11 21:00:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 21:00:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318526715] [2024-10-11 21:00:05,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318526715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381142943] [2024-10-11 21:00:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:05,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:05,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:05,083 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:05,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 21:00:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:05,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 21:00:05,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 21:00:05,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 21:00:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381142943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:05,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 21:00:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686970478] [2024-10-11 21:00:05,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 21:00:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 21:00:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:00:05,461 INFO L87 Difference]: Start difference. First operand 989 states and 1154 transitions. Second operand has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 21:00:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:06,052 INFO L93 Difference]: Finished difference Result 1612 states and 1865 transitions. [2024-10-11 21:00:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 21:00:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 89 [2024-10-11 21:00:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:06,058 INFO L225 Difference]: With dead ends: 1612 [2024-10-11 21:00:06,059 INFO L226 Difference]: Without dead ends: 1594 [2024-10-11 21:00:06,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2024-10-11 21:00:06,060 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 159 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:06,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 240 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:00:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-11 21:00:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1546. [2024-10-11 21:00:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1462 states have (on average 1.0957592339261286) internal successors, (1602), 1467 states have internal predecessors, (1602), 73 states have call successors, (73), 5 states have call predecessors, (73), 5 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 21:00:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1748 transitions. [2024-10-11 21:00:06,177 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1748 transitions. Word has length 89 [2024-10-11 21:00:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:06,178 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 1748 transitions. [2024-10-11 21:00:06,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 9.933333333333334) internal successors, (149), 16 states have internal predecessors, (149), 8 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 21:00:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1748 transitions. [2024-10-11 21:00:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 21:00:06,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:06,180 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:06,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 21:00:06,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 21:00:06,384 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 475728776, now seen corresponding path program 1 times [2024-10-11 21:00:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872671010] [2024-10-11 21:00:06,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:06,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 21:00:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-11 21:00:06,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872671010] [2024-10-11 21:00:06,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872671010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3211566] [2024-10-11 21:00:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:06,463 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:06,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 21:00:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:06,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:00:06,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 78 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:00:06,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 66 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 21:00:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3211566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:06,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:06,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2024-10-11 21:00:06,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097293917] [2024-10-11 21:00:06,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:06,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:00:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:06,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:00:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:00:06,719 INFO L87 Difference]: Start difference. First operand 1546 states and 1748 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-11 21:00:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:07,164 INFO L93 Difference]: Finished difference Result 2412 states and 2761 transitions. [2024-10-11 21:00:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 21:00:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 102 [2024-10-11 21:00:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:07,171 INFO L225 Difference]: With dead ends: 2412 [2024-10-11 21:00:07,171 INFO L226 Difference]: Without dead ends: 1935 [2024-10-11 21:00:07,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:00:07,174 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:07,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 259 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:00:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2024-10-11 21:00:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1651. [2024-10-11 21:00:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1561 states have (on average 1.0928891736066624) internal successors, (1706), 1566 states have internal predecessors, (1706), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-11 21:00:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1864 transitions. [2024-10-11 21:00:07,254 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 1864 transitions. Word has length 102 [2024-10-11 21:00:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 1864 transitions. [2024-10-11 21:00:07,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-11 21:00:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1864 transitions. [2024-10-11 21:00:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 21:00:07,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:07,256 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:07,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 21:00:07,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:07,457 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1669053778, now seen corresponding path program 1 times [2024-10-11 21:00:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200882263] [2024-10-11 21:00:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 21:00:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 21:00:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200882263] [2024-10-11 21:00:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200882263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410353768] [2024-10-11 21:00:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:07,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:07,572 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:07,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 21:00:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:07,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:00:07,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 21:00:07,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 21:00:07,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410353768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:07,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:07,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 21:00:07,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839636154] [2024-10-11 21:00:07,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:07,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 21:00:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:07,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 21:00:07,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:00:07,842 INFO L87 Difference]: Start difference. First operand 1651 states and 1864 transitions. Second operand has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-11 21:00:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:08,078 INFO L93 Difference]: Finished difference Result 2400 states and 2755 transitions. [2024-10-11 21:00:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:00:08,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 102 [2024-10-11 21:00:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:08,087 INFO L225 Difference]: With dead ends: 2400 [2024-10-11 21:00:08,087 INFO L226 Difference]: Without dead ends: 2399 [2024-10-11 21:00:08,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:00:08,089 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 125 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:08,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:00:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-11 21:00:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2351. [2024-10-11 21:00:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 2224 states have (on average 1.110611510791367) internal successors, (2470), 2229 states have internal predecessors, (2470), 116 states have call successors, (116), 5 states have call predecessors, (116), 5 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-11 21:00:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 2702 transitions. [2024-10-11 21:00:08,265 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 2702 transitions. Word has length 102 [2024-10-11 21:00:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:08,265 INFO L471 AbstractCegarLoop]: Abstraction has 2351 states and 2702 transitions. [2024-10-11 21:00:08,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-11 21:00:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2702 transitions. [2024-10-11 21:00:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 21:00:08,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:08,267 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:08,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 21:00:08,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 21:00:08,472 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 952620954, now seen corresponding path program 1 times [2024-10-11 21:00:08,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:08,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899678836] [2024-10-11 21:00:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 21:00:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 21:00:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 58 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 21:00:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899678836] [2024-10-11 21:00:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899678836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868002076] [2024-10-11 21:00:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:08,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:08,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:08,616 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:08,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 21:00:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:08,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:00:08,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 21:00:08,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 73 proven. 113 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 21:00:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868002076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:09,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-11 21:00:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324782290] [2024-10-11 21:00:09,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:00:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:00:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:00:09,037 INFO L87 Difference]: Start difference. First operand 2351 states and 2702 transitions. Second operand has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-11 21:00:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:09,563 INFO L93 Difference]: Finished difference Result 4572 states and 5354 transitions. [2024-10-11 21:00:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:00:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 133 [2024-10-11 21:00:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:09,576 INFO L225 Difference]: With dead ends: 4572 [2024-10-11 21:00:09,577 INFO L226 Difference]: Without dead ends: 3457 [2024-10-11 21:00:09,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 271 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:00:09,580 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:09,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 497 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:00:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2024-10-11 21:00:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 2619. [2024-10-11 21:00:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 2478 states have (on average 1.1073446327683616) internal successors, (2744), 2483 states have internal predecessors, (2744), 130 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-11 21:00:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3004 transitions. [2024-10-11 21:00:09,731 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3004 transitions. Word has length 133 [2024-10-11 21:00:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 2619 states and 3004 transitions. [2024-10-11 21:00:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 10 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-11 21:00:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3004 transitions. [2024-10-11 21:00:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 21:00:09,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:00:09,735 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:09,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-11 21:00:09,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:09,936 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-11 21:00:09,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:00:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -159059269, now seen corresponding path program 2 times [2024-10-11 21:00:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:00:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697574653] [2024-10-11 21:00:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:00:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:00:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:00:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:00:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:00:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:00:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:00:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 21:00:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 21:00:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 21:00:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:00:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 21:00:10,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:00:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697574653] [2024-10-11 21:00:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697574653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:00:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718303191] [2024-10-11 21:00:10,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:00:10,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:00:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:00:10,225 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:00:10,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 21:00:10,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:00:10,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:00:10,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 21:00:10,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:00:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 332 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:00:10,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:00:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 272 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 21:00:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718303191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:00:10,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:00:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2024-10-11 21:00:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444194338] [2024-10-11 21:00:10,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:00:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 21:00:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:00:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 21:00:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:00:10,657 INFO L87 Difference]: Start difference. First operand 2619 states and 3004 transitions. Second operand has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 21:00:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:00:10,820 INFO L93 Difference]: Finished difference Result 2627 states and 3010 transitions. [2024-10-11 21:00:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 21:00:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) Word has length 156 [2024-10-11 21:00:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:00:10,822 INFO L225 Difference]: With dead ends: 2627 [2024-10-11 21:00:10,822 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:00:10,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 314 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:00:10,828 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 55 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:00:10,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 744 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:00:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:00:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:00:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:00:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:00:10,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2024-10-11 21:00:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:00:10,831 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:00:10,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.764705882352942) internal successors, (149), 17 states have internal predecessors, (149), 8 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 21:00:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:00:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:00:10,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-11 21:00:10,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-11 21:00:10,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-11 21:00:10,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-11 21:00:10,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-11 21:00:10,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-11 21:00:10,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-11 21:00:10,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-11 21:00:10,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-11 21:00:10,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-11 21:00:10,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-11 21:00:10,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-11 21:00:10,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-11 21:00:10,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-11 21:00:10,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-11 21:00:10,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-11 21:00:10,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-11 21:00:10,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-11 21:00:10,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-11 21:00:10,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-11 21:00:10,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-11 21:00:10,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-11 21:00:10,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-11 21:00:11,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 21:00:11,043 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:00:11,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:00:14,369 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:00:14,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:00:14 BoogieIcfgContainer [2024-10-11 21:00:14,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:00:14,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:00:14,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:00:14,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:00:14,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:50" (3/4) ... [2024-10-11 21:00:14,433 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:00:14,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 21:00:14,437 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 21:00:14,441 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 21:00:14,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:00:14,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:00:14,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:00:14,541 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:00:14,542 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:00:14,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:00:14,542 INFO L158 Benchmark]: Toolchain (without parser) took 24729.64ms. Allocated memory was 157.3MB in the beginning and 325.1MB in the end (delta: 167.8MB). Free memory was 88.8MB in the beginning and 122.5MB in the end (delta: -33.6MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 79.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.78ms. Allocated memory is still 157.3MB. Free memory was 88.6MB in the beginning and 76.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 157.3MB. Free memory was 76.5MB in the beginning and 74.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: Boogie Preprocessor took 42.05ms. Allocated memory is still 157.3MB. Free memory was 74.8MB in the beginning and 73.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: RCFGBuilder took 531.49ms. Allocated memory is still 157.3MB. Free memory was 73.0MB in the beginning and 125.4MB in the end (delta: -52.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,543 INFO L158 Benchmark]: TraceAbstraction took 23735.18ms. Allocated memory was 157.3MB in the beginning and 325.1MB in the end (delta: 167.8MB). Free memory was 124.7MB in the beginning and 127.7MB in the end (delta: -3.1MB). Peak memory consumption was 195.5MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,544 INFO L158 Benchmark]: Witness Printer took 111.50ms. Allocated memory is still 325.1MB. Free memory was 127.7MB in the beginning and 122.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:00:14,545 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.13ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 79.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.78ms. Allocated memory is still 157.3MB. Free memory was 88.6MB in the beginning and 76.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 157.3MB. Free memory was 76.5MB in the beginning and 74.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.05ms. Allocated memory is still 157.3MB. Free memory was 74.8MB in the beginning and 73.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.49ms. Allocated memory is still 157.3MB. Free memory was 73.0MB in the beginning and 125.4MB in the end (delta: -52.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23735.18ms. Allocated memory was 157.3MB in the beginning and 325.1MB in the end (delta: 167.8MB). Free memory was 124.7MB in the beginning and 127.7MB in the end (delta: -3.1MB). Peak memory consumption was 195.5MB. Max. memory is 16.1GB. * Witness Printer took 111.50ms. Allocated memory is still 325.1MB. Free memory was 127.7MB in the beginning and 122.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 64 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2107 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2095 mSDsluCounter, 4819 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3553 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3878 IncrementalHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1266 mSDtfsCounter, 3878 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2431 GetRequests, 2134 SyntacticMatches, 25 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2619occurred in iteration=25, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 1431 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2518 NumberOfCodeBlocks, 2518 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3123 ConstructedInterpolants, 7 QuantifiedInterpolants, 10879 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2456 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 51 InterpolantComputations, 12 PerfectInterpolantSequences, 1891/3276 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 22 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= x1) && (2 <= counter)) && (2 <= x2)) && (y2 == 0)) && (counter <= 3)) && (y1 == 1)) && (((long long) x2 + y3) <= 2147483647)) && (x1 <= ((long long) 2 + y3))) && (x2 <= 1073741823)) && (0 <= y3)) || ((((((((((0 <= x1) && (y2 == 0)) && (y1 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (3 <= x2)) && (counter <= 5)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((((((0 <= x1) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 4)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (y2 == 0)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 <= x2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 1)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (y1 <= 2)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (x2 == 1)) && (counter <= 4)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (y3 <= 2147483644)) && (3 <= counter)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 == y2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483645)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (x2 <= 2147483647)) && (counter == 5)) && (2 <= y2)) && (y1 == 0)) && (y2 <= 2147483646)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y1 == 1)) && (3 <= x2)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((((0 <= x1) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (counter <= 5)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == x2)) && (y1 == 1)) && (counter <= 4)) && (y2 == 1)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (y3 <= 2147483644)) && (3 <= counter)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 == 1)) && (y2 == 0)) && (y1 == 1)) && (x1 <= ((long long) y3 + 1))) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x2 <= 2147483647)) && (2 <= y2)) && (y1 == 0)) && (counter <= 5)) && (y2 <= 3)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) y3 + 2147483644))) && (x1 <= 2147483647)) && (3 <= counter)) && (0 <= y3))) || ((((((((0 <= x1) && (x2 <= 2147483647)) && (x1 <= ((long long) y3 + 1))) && (y2 == 1)) && (y1 == 0)) && (y3 <= 2147483646)) && (counter == 1)) && (0 <= y3))) || (((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (1 <= x2)) && (y2 == 1)) && ((((long long) x2 * y1) + x2) <= 2147483647)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (y1 <= 2147483643)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (y2 <= 2147483644)) && (2 <= x2)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y1 == 1)) && (2 <= y2)) && ((((long long) x2 + y2) + y3) <= 2147483647)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || ((((((((((0 <= x1) && (((long long) x2 + y3) <= 2147483646)) && (y1 == 1)) && (y2 == 1)) && (3 <= x2)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || ((((((((((((0 <= x1) && ((((long long) x2 * y1) + ((long long) 2 * x2)) <= 2147483647)) && (1 <= x2)) && (y2 == 1)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && ((((long long) x2 * y1) + y3) <= 2147483646)) && (x1 <= 2147483647)) && (1 <= y1)) && (y1 <= 3)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (x2 == 1)) && (2 == y2)) && (y3 <= 2147483643)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y2)) && (x2 <= 2147483647)) && (counter <= 3)) && (y1 == 0)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || (((((((((0 <= x1) && (2 <= counter)) && (2 == y1)) && (x2 == 1)) && (y2 == 0)) && (counter <= 3)) && (x1 <= ((long long) 2 + y3))) && (y3 <= 2147483645)) && (0 <= y3))) || ((((((((((0 <= x1) && (2 == y1)) && (y2 <= 2147483644)) && (x2 == 1)) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (2 <= y2)) && (x1 <= 2147483647)) && (((long long) y2 + y3) <= 2147483645)) && (0 <= y3))) || ((((((((((0 <= x1) && (x1 <= ((long long) y3 + 2147483646))) && (counter == 5)) && (y2 == 0)) && (1 <= x2)) && ((((long long) x2 * y1) + y3) <= 2147483647)) && (y1 <= 2147483644)) && (x1 <= 2147483647)) && (1 <= y1)) && (0 <= y3))) || (((((((((((0 <= x1) && (2 <= x2)) && (((long long) x2 + y3) <= 2147483645)) && (2 == y2)) && (y1 == 1)) && (counter <= 5)) && (x1 <= ((long long) 2147483645 + y3))) && (4 <= counter)) && (x1 <= 2147483647)) && (x2 <= 1073741823)) && (0 <= y3))) || (((((((0 <= x1) && (y3 <= 2147483647)) && (x2 <= 2147483647)) && (y2 == 0)) && (x1 <= y3)) && (y1 == 0)) && (counter == 0))) || ((((((((((0 <= x1) && (x2 <= 2147483647)) && (counter == 4)) && (2 <= y2)) && (y1 == 0)) && (((long long) y2 + y3) <= 2147483647)) && (x1 <= ((long long) 2147483645 + y3))) && (x1 <= 2147483647)) && (y2 <= 2147483645)) && (0 <= y3))) - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((cond != 0) && (counter == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (((((cond != 0) || (counter < 4)) || (5 < counter)) && (((cond != 0) || (counter < 2)) || (3 < counter))) && ((cond != 0) || (counter != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:00:14,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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