/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:16:00,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:16:00,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:16:00,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:16:00,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:16:00,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:16:00,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:16:00,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:16:00,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:16:00,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:16:00,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:16:00,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:16:00,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:16:00,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:16:00,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:16:00,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:16:00,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:16:00,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:16:00,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:16:00,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:16:00,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:16:00,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:16:00,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:16:00,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:16:00,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:16:00,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:16:00,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:16:00,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:16:00,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:16:00,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:16:00,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:16:00,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:16:00,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:16:00,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:16:00,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:16:00,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:16:00,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:16:00,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:16:00,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:16:00,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:16:00,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:16:00,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:16:00,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:16:00,875 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:16:00,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:16:00,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:16:00,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:16:00,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:00,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:16:00,878 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:16:00,879 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:16:00,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:16:00,879 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:16:00,879 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:16:01,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:16:01,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:16:01,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:16:01,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:16:01,094 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:16:01,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-08 04:16:01,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dc222ba/4092c930a71d4ed6912438fcf31e8502/FLAGe7036d673 [2022-04-08 04:16:01,494 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:16:01,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-08 04:16:01,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dc222ba/4092c930a71d4ed6912438fcf31e8502/FLAGe7036d673 [2022-04-08 04:16:01,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dc222ba/4092c930a71d4ed6912438fcf31e8502 [2022-04-08 04:16:01,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:16:01,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:16:01,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:01,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:16:01,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:16:01,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01, skipping insertion in model container [2022-04-08 04:16:01,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:16:01,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:16:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c[403,416] [2022-04-08 04:16:01,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:01,692 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:16:01,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c[403,416] [2022-04-08 04:16:01,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:01,711 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:16:01,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01 WrapperNode [2022-04-08 04:16:01,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:01,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:16:01,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:16:01,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:16:01,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:16:01,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:16:01,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:16:01,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:16:01,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (1/1) ... [2022-04-08 04:16:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:01,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:16:01,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:16:01,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:16:01,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:16:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:16:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:16:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:16:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:16:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:16:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:16:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:16:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:16:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:16:01,828 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:16:01,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:16:01,911 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:16:01,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:16:01,916 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:16:01,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:01 BoogieIcfgContainer [2022-04-08 04:16:01,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:16:01,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:16:01,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:16:01,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:16:01,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:16:01" (1/3) ... [2022-04-08 04:16:01,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eac362e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:01, skipping insertion in model container [2022-04-08 04:16:01,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:01" (2/3) ... [2022-04-08 04:16:01,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eac362e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:01, skipping insertion in model container [2022-04-08 04:16:01,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:01" (3/3) ... [2022-04-08 04:16:01,923 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.c [2022-04-08 04:16:01,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:16:01,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:16:01,954 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:16:01,959 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 04:16:01,959 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:16:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:16:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 04:16:01,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:01,977 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:01,977 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -818707046, now seen corresponding path program 1 times [2022-04-08 04:16:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905776563] [2022-04-08 04:16:01,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -818707046, now seen corresponding path program 2 times [2022-04-08 04:16:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:01,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307149966] [2022-04-08 04:16:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:02,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:16:02,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495943176] [2022-04-08 04:16:02,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:16:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:16:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:02,120 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) [2022-04-08 04:16:02,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:16:02,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:16:02,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:16:02,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 04:16:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:02,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:16:02,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-08 04:16:02,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {24#true} is VALID [2022-04-08 04:16:02,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 04:16:02,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-08 04:16:02,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-08 04:16:02,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {24#true} is VALID [2022-04-08 04:16:02,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {47#(= main_~i~0 0)} is VALID [2022-04-08 04:16:02,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {51#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-08 04:16:02,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(not (< 0 (mod main_~n~0 4294967296)))} assume ~n~0 % 4294967296 > 0; {25#false} is VALID [2022-04-08 04:16:02,320 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-08 04:16:02,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 04:16:02,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 04:16:02,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 04:16:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:16:02,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:16:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:02,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307149966] [2022-04-08 04:16:02,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:16:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495943176] [2022-04-08 04:16:02,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495943176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:02,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:02,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:02,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:02,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905776563] [2022-04-08 04:16:02,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905776563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:02,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:02,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:16:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679156463] [2022-04-08 04:16:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:02,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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 13 [2022-04-08 04:16:02,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:02,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:02,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:02,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:16:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:16:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:16:02,376 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:02,489 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 04:16:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:16:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 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 13 [2022-04-08 04:16:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 04:16:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-08 04:16:02,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-08 04:16:02,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:02,561 INFO L225 Difference]: With dead ends: 42 [2022-04-08 04:16:02,562 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 04:16:02,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:16:02,568 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:02,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:16:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 04:16:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 04:16:02,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:02,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) [2022-04-08 04:16:02,599 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) [2022-04-08 04:16:02,599 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) [2022-04-08 04:16:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:02,609 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 04:16:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 04:16:02,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:02,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:02,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) Second operand 15 states. [2022-04-08 04:16:02,610 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) Second operand 15 states. [2022-04-08 04:16:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:02,612 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 04:16:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 04:16:02,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:02,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:02,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:02,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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) [2022-04-08 04:16:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 04:16:02,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-08 04:16:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:02,620 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 04:16:02,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:02,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 04:16:02,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 04:16:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:16:02,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:02,634 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:02,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:16:02,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 04:16:02,844 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1914943323, now seen corresponding path program 1 times [2022-04-08 04:16:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:02,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852491039] [2022-04-08 04:16:03,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:16:03,342 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:16:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 564616058, now seen corresponding path program 1 times [2022-04-08 04:16:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:03,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055285340] [2022-04-08 04:16:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:03,364 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_1.0) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_1.0)) 4294967296))) 0)) [2022-04-08 04:16:03,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:16:03,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260991898] [2022-04-08 04:16:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:03,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:16:03,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:03,372 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) [2022-04-08 04:16:03,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:16:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:03,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 04:16:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:03,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:16:16,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-08 04:16:16,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 04:16:16,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#(= ~SIZE~0 20000001)} assume true; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 04:16:16,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#(= ~SIZE~0 20000001)} {212#true} #55#return; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 04:16:16,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#(= ~SIZE~0 20000001)} call #t~ret5 := main(); {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 04:16:16,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(= ~SIZE~0 20000001)} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {220#(= ~SIZE~0 20000001)} is VALID [2022-04-08 04:16:16,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= ~SIZE~0 20000001)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {236#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} is VALID [2022-04-08 04:16:16,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~k~0 main_~j~0))} [59] L21-2-->L21-3_primed: Formula: (let ((.cse0 (= v_main_~j~0_8 v_main_~j~0_7)) (.cse1 (= v_main_~k~0_8 v_main_~k~0_7)) (.cse2 (= v_main_~i~0_9 v_main_~i~0_8)) (.cse4 (mod v_main_~i~0_9 4294967296)) (.cse3 (mod v_main_~n~0_10 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~n~0_10 v_main_~n~0_10)) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4)) (let ((.cse5 (* (div (+ (- v_main_~i~0_8) v_main_~i~0_9) (- 3)) 3))) (and (< .cse4 .cse3) (forall ((v_it_1 Int)) (or (< (mod (+ v_main_~i~0_9 (* v_it_1 3)) 4294967296) (mod v_main_~n~0_10 4294967296)) (not (<= (+ v_it_1 1) (div (+ v_main_~i~0_9 (* (- 1) v_main_~i~0_8)) (- 3)))) (not (<= 1 v_it_1)))) (= (+ v_main_~j~0_8 .cse5) v_main_~j~0_7) (= (mod (+ v_main_~i~0_9 (* v_main_~i~0_8 2)) 3) 0) (= v_main_~k~0_7 (+ v_main_~k~0_8 .cse5)) (< 0 (div (+ v_main_~i~0_9 (* (- 1) v_main_~i~0_8)) (- 3))))))) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_8, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_10, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {240#(and (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (or (and (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))))} is VALID [2022-04-08 04:16:16,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(and (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (or (and (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))))} [58] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {244#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (or (and (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))))} is VALID [2022-04-08 04:16:16,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (or (and (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0))))} assume ~n~0 % 4294967296 > 0; {248#(and (= ~SIZE~0 20000001) (exists ((aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_div_aux_mod_main_~n~0_26_37 Int)) (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)) (< (mod (* v_it_1 3) 4294967296) (mod aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)))) (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (<= (+ (* aux_div_aux_mod_main_~n~0_26_37 4294967296) aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)) (mod main_~i~0 4294967296)) (< 0 (+ aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (< (+ aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)) 4294967296) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (<= aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (mod ~SIZE~0 4294967296)) (<= 0 (+ (* aux_div_aux_mod_main_~n~0_26_37 4294967296) aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48))))} is VALID [2022-04-08 04:16:16,884 INFO L272 TraceCheckUtils]: 10: Hoare triple {248#(and (= ~SIZE~0 20000001) (exists ((aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_div_aux_mod_main_~n~0_26_37 Int)) (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)) (< (mod (* v_it_1 3) 4294967296) (mod aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)))) (= main_~k~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (<= (+ (* aux_div_aux_mod_main_~n~0_26_37 4294967296) aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)) (mod main_~i~0 4294967296)) (< 0 (+ aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296))) (= main_~j~0 (* 3 (div (* (- 1) main_~i~0) (- 3)))) (< (+ aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)) 4294967296) (= (mod (* main_~i~0 2) 3) 0) (< 0 (div (* (- 1) main_~i~0) (- 3))) (<= aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (mod ~SIZE~0 4294967296)) (<= 0 (+ (* aux_div_aux_mod_main_~n~0_26_37 4294967296) aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48))))} call __VERIFIER_assert((if (~i~0 % 4294967296 == ~j~0 % 4294967296 && ~j~0 % 4294967296 == ~k~0 % 4294967296) && 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) then (if (2 + ~SIZE~0) % 4294967296 < 0 then ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) + (2 + ~SIZE~0) % 4294967296 else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296) - (2 + ~SIZE~0) % 4294967296) else ~i~0 % 4294967296 % ((2 + ~SIZE~0) % 4294967296)) % 4294967296 then 1 else 0)); {252#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-08 04:16:16,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {256#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-08 04:16:16,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {256#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {213#false} is VALID [2022-04-08 04:16:16,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-08 04:16:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:16:16,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:16:16,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:16,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055285340] [2022-04-08 04:16:16,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:16:16,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260991898] [2022-04-08 04:16:16,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260991898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:16,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:16,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:16:19,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1852491039] [2022-04-08 04:16:19,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1852491039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:19,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:19,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:16:19,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331955714] [2022-04-08 04:16:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:19,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-08 04:16:19,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:19,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-04-08 04:16:19,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:19,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:16:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:16:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2022-04-08 04:16:19,886 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-04-08 04:16:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:20,031 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 04:16:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:16:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 14 [2022-04-08 04:16:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-04-08 04:16:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-08 04:16:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-04-08 04:16:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2022-04-08 04:16:20,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2022-04-08 04:16:20,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:20,630 INFO L225 Difference]: With dead ends: 15 [2022-04-08 04:16:20,631 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:16:20,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2022-04-08 04:16:20,632 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:20,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-04-08 04:16:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:16:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:16:20,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:20,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-08 04:16:20,633 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-08 04:16:20,633 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-08 04:16:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:20,633 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:16:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:16:20,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:20,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:20,633 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-08 04:16:20,633 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-08 04:16:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:20,633 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:16:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:16:20,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:20,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:20,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:20,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:20,634 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) [2022-04-08 04:16:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:16:20,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-08 04:16:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:20,634 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:16:20,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-04-08 04:16:20,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:16:20,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:16:20,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:20,636 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:16:20,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:16:20,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 04:16:20,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:16:21,409 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 04:16:21,410 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 29) the Hoare annotation is: true [2022-04-08 04:16:21,410 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (or (exists ((aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 Int) (aux_div_aux_mod_main_~n~0_26_37 Int)) (let ((.cse4 (* aux_div_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)) (.cse3 (div (* (- 1) main_~i~0) (- 3)))) (let ((.cse0 (* 3 .cse3)) (.cse2 (+ aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 .cse4)) (.cse1 (+ (* aux_div_aux_mod_main_~n~0_26_37 4294967296) aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 .cse4))) (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)) (< (mod (* v_it_1 3) 4294967296) (mod aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 4294967296)))) (= main_~k~0 .cse0) (<= .cse1 (mod main_~i~0 4294967296)) (< 0 .cse2) (= main_~j~0 .cse0) (< .cse2 4294967296) (= (mod (* main_~i~0 2) 3) 0) (< 0 .cse3) (<= aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48 (mod ~SIZE~0 4294967296)) (<= 0 .cse1) (<= 0 aux_mod_aux_mod_aux_mod_main_~n~0_26_37_48))))) (not (= ~SIZE~0 20000001))) [2022-04-08 04:16:21,410 INFO L885 garLoopResultBuilder]: At program point L26(lines 26 27) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 29) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (let ((.cse0 (mod main_~n~0 4294967296))) (let ((.cse1 (<= .cse0 (mod ~SIZE~0 4294967296)))) (or (and (< (mod (+ main_~i~0 4294967293) 4294967296) .cse0) .cse1 (or (let ((.cse3 (div (+ (* (- 1) main_~i~0) 3) (- 3)))) (let ((.cse2 (+ 3 (* 3 .cse3)))) (and (= .cse2 main_~k~0) (= (mod (* main_~i~0 2) 3) 0) (< 0 .cse3) (= .cse2 main_~j~0) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (+ (* (- 1) main_~i~0) 3) (- 3)))) (not (<= 1 v_it_1))))))) (and (= main_~j~0 3) (= main_~i~0 3) (= main_~k~0 3)))) (not (= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~j~0 0) .cse1 (= main_~i~0 0))))) [2022-04-08 04:16:21,411 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 16 29) the Hoare annotation is: (let ((.cse2 (mod main_~n~0 4294967296))) (let ((.cse0 (< 0 .cse2))) (or (and (= main_~i~0 0) (not .cse0)) (not (= ~SIZE~0 20000001)) (let ((.cse3 (div (* (- 1) main_~i~0) (- 3)))) (let ((.cse1 (* 3 .cse3))) (and (= main_~k~0 .cse1) (= main_~j~0 .cse1) (not (< (mod main_~i~0 4294967296) .cse2)) (= (mod (* main_~i~0 2) 3) 0) (< 0 .cse3) (<= .cse2 (mod ~SIZE~0 4294967296)) (forall ((v_it_1 Int)) (or (< (mod (* v_it_1 3) 4294967296) (mod main_~n~0 4294967296)) (not (<= (+ v_it_1 1) (div (* (- 1) main_~i~0) (- 3)))) (not (<= 1 v_it_1)))) .cse0)))))) [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 29) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~SIZE~0 20000001) [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~SIZE~0 20000001) [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~SIZE~0 20000001) [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:16:21,411 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-08 04:16:21,412 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond| 1)) [2022-04-08 04:16:21,412 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-08 04:16:21,412 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (or (not (= |__VERIFIER_assert_#in~cond| 1)) (= __VERIFIER_assert_~cond 1)) [2022-04-08 04:16:21,412 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-08 04:16:21,412 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond| 1)) [2022-04-08 04:16:21,414 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-08 04:16:21,415 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:16:21,417 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:16:21,421 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 04:16:21,422 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 04:16:21,422 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 04:16:21,422 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 04:16:21,424 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 04:16:25,531 INFO L163 areAnnotationChecker]: CFG has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:16:25,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:16:25 BoogieIcfgContainer [2022-04-08 04:16:25,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:16:25,542 INFO L158 Benchmark]: Toolchain (without parser) took 24026.08ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 133.2MB in the beginning and 112.7MB in the end (delta: 20.5MB). Peak memory consumption was 74.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:25,542 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 149.3MB in the beginning and 149.2MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:25,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.74ms. Allocated memory is still 182.5MB. Free memory was 133.0MB in the beginning and 158.3MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:16:25,543 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:16:25,544 INFO L158 Benchmark]: RCFGBuilder took 170.91ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 146.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 04:16:25,544 INFO L158 Benchmark]: TraceAbstraction took 23622.66ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 145.5MB in the beginning and 112.7MB in the end (delta: 32.8MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:25,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 149.3MB in the beginning and 149.2MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.74ms. Allocated memory is still 182.5MB. Free memory was 133.0MB in the beginning and 158.3MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 182.5MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 170.91ms. Allocated memory is still 182.5MB. Free memory was 156.7MB in the beginning and 146.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23622.66ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 145.5MB in the beginning and 112.7MB in the end (delta: 32.8MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] * 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: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 29 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 27 PreInvPairs, 44 NumberOfFragments, 358 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2022-04-08 04:16:25,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,556 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,557 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,557 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] [2022-04-08 04:16:25,557 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_1,QUANTIFIED] Derived loop invariant: ((((i + 4294967293) % 4294967296 < n % 4294967296 && n % 4294967296 <= SIZE % 4294967296) && (((((3 + 3 * ((-1 * i + 3) / -3) == k && i * 2 % 3 == 0) && 0 < (-1 * i + 3) / -3) && 3 + 3 * ((-1 * i + 3) / -3) == j) && (forall v_it_1 : int :: (v_it_1 * 3 % 4294967296 < n % 4294967296 || !(v_it_1 + 1 <= (-1 * i + 3) / -3)) || !(1 <= v_it_1))) || ((j == 3 && i == 3) && k == 3))) || !(SIZE == 20000001)) || (((k == 0 && j == 0) && n % 4294967296 <= SIZE % 4294967296) && i == 0) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 04:16:25,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...