./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:58:32,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:58:32,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:58:32,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:58:32,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:58:32,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:58:32,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:58:32,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:58:32,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:58:32,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:58:32,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:58:32,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:58:32,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:58:32,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:58:32,871 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:58:32,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:58:32,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:58:32,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:58:32,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:58:32,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:58:32,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:58:32,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:58:32,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:58:32,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:58:32,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:58:32,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:58:32,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:58:32,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:58:32,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:58:32,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:58:32,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:58:32,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:58:32,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:58:32,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:58:32,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:58:32,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:58:32,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:58:32,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:58:32,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:58:32,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:58:32,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:58:32,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:58:32,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:58:32,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:58:32,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 [2024-10-13 13:58:33,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:58:33,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:58:33,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:58:33,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:58:33,146 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:58:33,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2024-10-13 13:58:34,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:58:34,771 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:58:34,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2024-10-13 13:58:34,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddff5e1e2/329d8df6916c4291b9e2dd7f2a83aba0/FLAG8b460b9cd [2024-10-13 13:58:34,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddff5e1e2/329d8df6916c4291b9e2dd7f2a83aba0 [2024-10-13 13:58:34,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:58:34,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:58:34,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:58:34,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:58:34,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:58:34,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:58:34" (1/1) ... [2024-10-13 13:58:34,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38876205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:34, skipping insertion in model container [2024-10-13 13:58:34,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:58:34" (1/1) ... [2024-10-13 13:58:34,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:58:35,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:58:35,069 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:58:35,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:58:35,105 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:58:35,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35 WrapperNode [2024-10-13 13:58:35,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:58:35,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:58:35,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:58:35,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:58:35,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,132 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-10-13 13:58:35,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:58:35,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:58:35,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:58:35,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:58:35,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,155 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-13 13:58:35,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:58:35,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:58:35,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:58:35,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:58:35,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (1/1) ... [2024-10-13 13:58:35,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:58:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:58:35,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:58:35,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:58:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 13:58:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 13:58:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:58:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-10-13 13:58:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-10-13 13:58:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:58:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 13:58:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-10-13 13:58:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-10-13 13:58:35,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:58:35,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:58:35,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:58:35,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:58:35,535 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 13:58:35,538 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:58:35,569 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:58:35,569 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 13:58:35,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:58:35 BoogieIcfgContainer [2024-10-13 13:58:35,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:58:35,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:58:35,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:58:35,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:58:35,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:58:34" (1/3) ... [2024-10-13 13:58:35,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d464a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:58:35, skipping insertion in model container [2024-10-13 13:58:35,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:58:35" (2/3) ... [2024-10-13 13:58:35,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d464a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:58:35, skipping insertion in model container [2024-10-13 13:58:35,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:58:35" (3/3) ... [2024-10-13 13:58:35,583 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-10-13 13:58:35,596 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:58:35,596 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 13:58:35,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:58:35,666 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;@574406fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:58:35,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 13:58:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 13:58:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:58:35,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:35,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:35,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:35,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash 344065493, now seen corresponding path program 1 times [2024-10-13 13:58:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240051058] [2024-10-13 13:58:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240051058] [2024-10-13 13:58:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240051058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:58:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031897410] [2024-10-13 13:58:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:35,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:58:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:58:35,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:35,974 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:36,053 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2024-10-13 13:58:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:58:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:58:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:36,064 INFO L225 Difference]: With dead ends: 85 [2024-10-13 13:58:36,064 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 13:58:36,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:36,072 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:36,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:58:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 13:58:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-13 13:58:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:58:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-13 13:58:36,120 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2024-10-13 13:58:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:36,121 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-13 13:58:36,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-13 13:58:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:58:36,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:36,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:36,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:58:36,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash 344065717, now seen corresponding path program 1 times [2024-10-13 13:58:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:36,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272400033] [2024-10-13 13:58:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:36,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272400033] [2024-10-13 13:58:36,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272400033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:36,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:36,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:58:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919083263] [2024-10-13 13:58:36,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:58:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:36,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:58:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:36,198 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:36,227 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-13 13:58:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:58:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:58:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:36,230 INFO L225 Difference]: With dead ends: 34 [2024-10-13 13:58:36,230 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 13:58:36,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:36,232 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:36,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:58:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 13:58:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-13 13:58:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:58:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-13 13:58:36,246 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2024-10-13 13:58:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:36,246 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-13 13:58:36,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-13 13:58:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:58:36,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:36,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:36,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:58:36,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:36,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2076095759, now seen corresponding path program 1 times [2024-10-13 13:58:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300447475] [2024-10-13 13:58:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300447475] [2024-10-13 13:58:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300447475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:58:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937874002] [2024-10-13 13:58:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:36,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:58:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:58:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:58:36,377 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:36,499 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-13 13:58:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:58:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:58:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:36,502 INFO L225 Difference]: With dead ends: 33 [2024-10-13 13:58:36,502 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 13:58:36,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:58:36,505 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:36,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 13:58:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-10-13 13:58:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:58:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-13 13:58:36,519 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2024-10-13 13:58:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:36,522 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-13 13:58:36,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-13 13:58:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 13:58:36,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:36,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:36,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:58:36,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:36,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2076102710, now seen corresponding path program 1 times [2024-10-13 13:58:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228342715] [2024-10-13 13:58:36,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228342715] [2024-10-13 13:58:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228342715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:58:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586556094] [2024-10-13 13:58:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:58:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:58:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:58:36,607 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:36,724 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-10-13 13:58:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:58:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 13:58:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:36,725 INFO L225 Difference]: With dead ends: 32 [2024-10-13 13:58:36,727 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 13:58:36,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:58:36,728 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:36,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 13:58:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-13 13:58:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:58:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-13 13:58:36,742 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2024-10-13 13:58:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:36,743 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-13 13:58:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-13 13:58:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 13:58:36,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:36,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:58:36,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash 968654561, now seen corresponding path program 1 times [2024-10-13 13:58:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150809673] [2024-10-13 13:58:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150809673] [2024-10-13 13:58:36,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150809673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:36,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:58:36,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612885143] [2024-10-13 13:58:36,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:36,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:58:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:36,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:58:36,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:36,833 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:36,853 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-13 13:58:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:58:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-13 13:58:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:36,855 INFO L225 Difference]: With dead ends: 29 [2024-10-13 13:58:36,855 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 13:58:36,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:58:36,856 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:36,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:58:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 13:58:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 13:58:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 13:58:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-13 13:58:36,865 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2024-10-13 13:58:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:36,865 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-13 13:58:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-13 13:58:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:58:36,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:36,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:36,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:58:36,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:36,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:36,867 INFO L85 PathProgramCache]: Analyzing trace with hash -36479637, now seen corresponding path program 1 times [2024-10-13 13:58:36,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:36,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948864774] [2024-10-13 13:58:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:37,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948864774] [2024-10-13 13:58:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948864774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:37,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 13:58:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183601915] [2024-10-13 13:58:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:58:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:37,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:58:37,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:58:37,112 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:37,272 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-13 13:58:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:58:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-13 13:58:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:37,274 INFO L225 Difference]: With dead ends: 39 [2024-10-13 13:58:37,274 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 13:58:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:58:37,275 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:37,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 13:58:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-10-13 13:58:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 13:58:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-13 13:58:37,291 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 17 [2024-10-13 13:58:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:37,291 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-13 13:58:37,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-13 13:58:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 13:58:37,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:37,293 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:37,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:58:37,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:37,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1750023969, now seen corresponding path program 1 times [2024-10-13 13:58:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414659145] [2024-10-13 13:58:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:37,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414659145] [2024-10-13 13:58:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414659145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:58:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047551832] [2024-10-13 13:58:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:58:37,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:58:37,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:58:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:37,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 13:58:37,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:58:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:58:37,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:58:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047551832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:37,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:58:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-10-13 13:58:37,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501432642] [2024-10-13 13:58:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:37,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 13:58:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:37,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 13:58:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-10-13 13:58:37,958 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:38,122 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-13 13:58:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:58:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-13 13:58:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:38,123 INFO L225 Difference]: With dead ends: 45 [2024-10-13 13:58:38,123 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 13:58:38,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:58:38,124 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:38,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 13:58:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 13:58:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 13:58:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-13 13:58:38,140 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 23 [2024-10-13 13:58:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:38,141 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-13 13:58:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 13:58:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-13 13:58:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:58:38,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:38,142 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] [2024-10-13 13:58:38,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 13:58:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:38,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:38,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1368678893, now seen corresponding path program 1 times [2024-10-13 13:58:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:38,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658946076] [2024-10-13 13:58:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:58:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:58:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658946076] [2024-10-13 13:58:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658946076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:58:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083587172] [2024-10-13 13:58:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:58:38,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:58:38,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:58:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:38,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 13:58:38,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:58:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 13:58:38,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:58:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083587172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:58:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-10-13 13:58:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130565592] [2024-10-13 13:58:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:58:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:58:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:58:38,910 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:58:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:39,084 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-13 13:58:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:58:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-13 13:58:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:39,085 INFO L225 Difference]: With dead ends: 42 [2024-10-13 13:58:39,086 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 13:58:39,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:58:39,087 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:39,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 202 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 13:58:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-13 13:58:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 13:58:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-13 13:58:39,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2024-10-13 13:58:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 13:58:39,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:58:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-13 13:58:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:58:39,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:39,096 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] [2024-10-13 13:58:39,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 13:58:39,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 13:58:39,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash 550406189, now seen corresponding path program 1 times [2024-10-13 13:58:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063242281] [2024-10-13 13:58:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:58:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:58:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063242281] [2024-10-13 13:58:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063242281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:58:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 13:58:39,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552679111] [2024-10-13 13:58:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:39,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:58:39,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:58:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:58:39,488 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:58:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:39,670 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-10-13 13:58:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:58:39,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-13 13:58:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:39,671 INFO L225 Difference]: With dead ends: 45 [2024-10-13 13:58:39,671 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 13:58:39,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:58:39,672 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:39,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 13:58:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-13 13:58:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 13:58:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-13 13:58:39,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2024-10-13 13:58:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-13 13:58:39,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 13:58:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-13 13:58:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 13:58:39,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:58:39,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:58:39,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:58:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:58:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -833435093, now seen corresponding path program 1 times [2024-10-13 13:58:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:58:39,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953032285] [2024-10-13 13:58:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:58:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 13:58:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:58:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 13:58:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 13:58:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:58:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953032285] [2024-10-13 13:58:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953032285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:58:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959431456] [2024-10-13 13:58:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:58:40,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:58:40,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 13:58:40,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:58:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:58:40,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 13:58:40,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:58:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 13:58:40,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:58:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959431456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:58:40,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:58:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-10-13 13:58:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342048221] [2024-10-13 13:58:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:58:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 13:58:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:58:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 13:58:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:58:40,383 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:58:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:58:40,534 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-10-13 13:58:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:58:40,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-13 13:58:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:58:40,536 INFO L225 Difference]: With dead ends: 43 [2024-10-13 13:58:40,536 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 13:58:40,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2024-10-13 13:58:40,537 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:58:40,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:58:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 13:58:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 13:58:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:58:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 13:58:40,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-10-13 13:58:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:58:40,538 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 13:58:40,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 13:58:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 13:58:40,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 13:58:40,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 13:58:40,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 13:58:40,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 13:58:40,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 13:58:40,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 13:58:40,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 13:58:40,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 13:58:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:58:40,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:58:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 13:58:41,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:58:41,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:58:41 BoogieIcfgContainer [2024-10-13 13:58:41,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:58:41,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:58:41,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:58:41,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:58:41,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:58:35" (3/4) ... [2024-10-13 13:58:41,133 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 13:58:41,136 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2024-10-13 13:58:41,137 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2024-10-13 13:58:41,137 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2024-10-13 13:58:41,141 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-13 13:58:41,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-13 13:58:41,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 13:58:41,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:58:41,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 13:58:41,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:58:41,228 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 13:58:41,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:58:41,229 INFO L158 Benchmark]: Toolchain (without parser) took 6423.15ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 82.5MB in the beginning and 137.4MB in the end (delta: -54.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:58:41,229 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:58:41,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.29ms. Allocated memory is still 148.9MB. Free memory was 82.3MB in the beginning and 120.7MB in the end (delta: -38.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.86ms. Allocated memory is still 148.9MB. Free memory was 120.7MB in the beginning and 119.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,230 INFO L158 Benchmark]: Boogie Preprocessor took 34.27ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,230 INFO L158 Benchmark]: RCFGBuilder took 400.40ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 103.5MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,230 INFO L158 Benchmark]: TraceAbstraction took 5553.03ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 103.0MB in the beginning and 142.6MB in the end (delta: -39.6MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,230 INFO L158 Benchmark]: Witness Printer took 98.02ms. Allocated memory is still 182.5MB. Free memory was 142.6MB in the beginning and 137.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 13:58:41,233 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.29ms. Allocated memory is still 148.9MB. Free memory was 82.3MB in the beginning and 120.7MB in the end (delta: -38.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.86ms. Allocated memory is still 148.9MB. Free memory was 120.7MB in the beginning and 119.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.27ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 117.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.40ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 103.5MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5553.03ms. Allocated memory was 148.9MB in the beginning and 182.5MB in the end (delta: 33.6MB). Free memory was 103.0MB in the beginning and 142.6MB in the end (delta: -39.6MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * Witness Printer took 98.02ms. Allocated memory is still 182.5MB. Free memory was 142.6MB in the beginning and 137.4MB 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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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 4 procedures, 46 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 915 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 676 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1016 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 239 mSDtfsCounter, 1016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 8 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 44/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error. Ensures: 0 - ProcedureContractResult [Line: 32]: Procedure Contract for divides Derived contract for procedure divides. Requires: ((m <= 2147483647) && (1 <= n)) Ensures: ((m <= 2147483647) && (1 <= n)) - ProcedureContractResult [Line: 17]: Procedure Contract for gcd Derived contract for procedure gcd. Requires: ((y1 <= 2147483647) && (y2 <= 2147483647)) Ensures: (((y1 <= 2147483647) && (1 <= \result)) && (y2 <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-10-13 13:58:41,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE