/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/sum_natnum.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:10:15,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:10:15,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:10:15,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:10:15,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:10:15,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:10:15,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:10:15,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:10:15,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:10:15,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:10:15,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:10:15,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:10:15,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:10:15,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:10:15,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:10:15,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:10:15,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:10:15,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:10:15,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:10:15,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:10:15,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:10:15,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:10:15,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:10:15,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:10:15,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:10:15,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:10:15,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:10:15,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:10:15,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:10:15,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:10:15,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:10:15,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:10:15,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:10:15,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:10:15,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:10:15,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:10:15,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:10:15,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:10:15,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:10:15,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:10:15,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:10:15,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:10:15,929 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:10:15,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:10:15,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:10:15,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:10:15,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:10:15,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:10:15,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:10:15,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:10:15,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:10:15,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:10:15,938 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:10:15,938 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:10:15,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:10:15,938 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:10:15,938 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:10:16,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:10:16,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:10:16,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:10:16,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:10:16,131 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:10:16,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-08 04:10:16,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a186c69de/9715ef91f5f94db4a6c8f95f68580cff/FLAG87bc8e2f2 [2022-04-08 04:10:16,536 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:10:16,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-08 04:10:16,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a186c69de/9715ef91f5f94db4a6c8f95f68580cff/FLAG87bc8e2f2 [2022-04-08 04:10:16,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a186c69de/9715ef91f5f94db4a6c8f95f68580cff [2022-04-08 04:10:16,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:10:16,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:10:16,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:10:16,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:10:16,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:10:16,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210035f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16, skipping insertion in model container [2022-04-08 04:10:16,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:10:16,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:10:16,742 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/sum_natnum.c[458,471] [2022-04-08 04:10:16,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:10:16,767 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:10:16,775 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/sum_natnum.c[458,471] [2022-04-08 04:10:16,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:10:16,786 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:10:16,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16 WrapperNode [2022-04-08 04:10:16,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:10:16,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:10:16,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:10:16,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:10:16,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:10:16,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:10:16,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:10:16,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:10:16,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (1/1) ... [2022-04-08 04:10:16,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:10:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:10:16,857 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:10:16,887 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:10:16,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:10:16,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:10:16,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:10:16,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:10:16,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:10:16,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:10:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:10:16,909 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:10:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:10:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:10:16,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:10:16,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:10:16,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:10:16,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:10:16,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:10:16,968 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:10:16,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:10:17,081 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:10:17,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:10:17,087 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:10:17,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:10:17 BoogieIcfgContainer [2022-04-08 04:10:17,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:10:17,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:10:17,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:10:17,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:10:17,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:10:16" (1/3) ... [2022-04-08 04:10:17,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942e8de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:10:17, skipping insertion in model container [2022-04-08 04:10:17,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:16" (2/3) ... [2022-04-08 04:10:17,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3942e8de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:10:17, skipping insertion in model container [2022-04-08 04:10:17,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:10:17" (3/3) ... [2022-04-08 04:10:17,112 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_natnum.c [2022-04-08 04:10:17,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:10:17,115 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:10:17,155 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:10:17,160 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:10:17,171 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:10:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:10:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:10:17,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:10:17,196 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:10:17,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:10:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:10:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 1 times [2022-04-08 04:10:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:17,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941940831] [2022-04-08 04:10:17,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:10:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 2 times [2022-04-08 04:10:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:10:17,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264318622] [2022-04-08 04:10:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:10:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:10:17,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:10:17,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62309765] [2022-04-08 04:10:17,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:10:17,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:10:17,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:10:17,305 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:10:17,343 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:10:17,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:10:17,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:10:17,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 04:10:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:17,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:10:17,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2022-04-08 04:10:17,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#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(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 04:10:17,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(<= 40000 ~SIZE~0)} assume true; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 04:10:17,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#(<= 40000 ~SIZE~0)} {22#true} #45#return; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 04:10:17,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-08 04:10:17,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-08 04:10:17,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {23#false} is VALID [2022-04-08 04:10:17,551 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23#false} is VALID [2022-04-08 04:10:17,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 04:10:17,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 04:10:17,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 04:10:17,552 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:10:17,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:10:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:10:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264318622] [2022-04-08 04:10:17,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:10:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62309765] [2022-04-08 04:10:17,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62309765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:17,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:10:17,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:10:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941940831] [2022-04-08 04:10:17,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941940831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:17,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:17,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:10:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781391205] [2022-04-08 04:10:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:10:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 04:10:17,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:10:17,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:10:17,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:17,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:10:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:10:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:10:17,600 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:10:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:23,749 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 04:10:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:10:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 04:10:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:10:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:10:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 04:10:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:10:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 04:10:23,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 04:10:23,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:23,801 INFO L225 Difference]: With dead ends: 32 [2022-04-08 04:10:23,801 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 04:10:23,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:10:23,806 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:10:23,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:10:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 04:10:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 04:10:23,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:10:23,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:10:23,864 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:10:23,865 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:10:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:23,867 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 04:10:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 04:10:23,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:23,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:23,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 04:10:23,868 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 04:10:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:23,879 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 04:10:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 04:10:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:23,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:23,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:10:23,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:10:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:10:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 04:10:23,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 04:10:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:10:23,883 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 04:10:23,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:10:23,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 04:10:23,896 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:10:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 04:10:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 04:10:23,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:10:23,897 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:10:23,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 04:10:24,118 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:10:24,119 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:10:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:10:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 1 times [2022-04-08 04:10:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:24,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785361913] [2022-04-08 04:10:25,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:10:25,916 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:10:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1171643219, now seen corresponding path program 1 times [2022-04-08 04:10:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:10:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678097843] [2022-04-08 04:10:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:10:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:10:25,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:10:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354817472] [2022-04-08 04:10:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:10:25,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:10:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:10:25,931 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:10:25,933 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:10:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:25,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:10:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:26,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:11:04,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-08 04:11:04,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#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(13, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 40000; {182#(= ~SIZE~0 40000)} is VALID [2022-04-08 04:11:04,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#(= ~SIZE~0 40000)} assume true; {182#(= ~SIZE~0 40000)} is VALID [2022-04-08 04:11:04,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#(= ~SIZE~0 40000)} {174#true} #45#return; {182#(= ~SIZE~0 40000)} is VALID [2022-04-08 04:11:04,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#(= ~SIZE~0 40000)} call #t~ret4 := main(); {182#(= ~SIZE~0 40000)} is VALID [2022-04-08 04:11:04,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#(= ~SIZE~0 40000)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {195#(and (= ~SIZE~0 40000) (= main_~sum~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:11:04,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(and (= ~SIZE~0 40000) (= main_~sum~0 0) (= main_~i~0 0))} [49] L23-2-->L23-3_primed: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_8)) (.cse2 (* (- 1) v_main_~i~0_7)) (.cse4 (= v_main_~sum~0_9 v_main_~sum~0_8)) (.cse5 (= v_main_~i~0_8 v_main_~i~0_7))) (or (let ((.cse0 (div (+ v_main_~i~0_8 .cse2) (- 2)))) (and (= (mod (+ v_main_~i~0_8 v_main_~i~0_7) 2) 0) (< .cse0 (+ (div (+ v_~SIZE~0_8 (- 2) .cse1) 2) 2)) (< 0 .cse0) (= (+ (* 2 (* v_main_~i~0_8 .cse0)) .cse0 (* (* .cse0 .cse0) 2) v_main_~sum~0_9) v_main_~sum~0_8))) (let ((.cse3 (div (+ v_main_~i~0_8 .cse2 1) (- 2)))) (and (< .cse3 (+ (div (+ (- 1) v_~SIZE~0_8 .cse1) 2) 1)) (<= 0 .cse3) (= (mod (+ v_main_~i~0_8 v_main_~i~0_7 1) 2) 0) (= (+ v_main_~i~0_8 (* 2 (* .cse3 v_main_~i~0_8)) (* .cse3 3) (* (* .cse3 .cse3) 2) v_main_~sum~0_9 1) v_main_~sum~0_8))) (and .cse4 .cse5 (not (< v_main_~i~0_8 v_~SIZE~0_8))) (and .cse4 .cse5 (= v_~SIZE~0_8 v_~SIZE~0_8)))) InVars {~SIZE~0=v_~SIZE~0_8, main_~i~0=v_main_~i~0_8, main_~sum~0=v_main_~sum~0_9} OutVars{~SIZE~0=v_~SIZE~0_8, main_~i~0=v_main_~i~0_7, main_~sum~0=v_main_~sum~0_8} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {199#(and (= ~SIZE~0 40000) (or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (< 0 (div (* (- 1) main_~i~0) (- 2))) (= (+ (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (div (* (- 1) main_~i~0) (- 2))) main_~sum~0)) (and (= main_~sum~0 0) (= main_~i~0 0)) (and (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) ~SIZE~0) 2) 1)) (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= (+ (* 3 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))) 1) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0))))} is VALID [2022-04-08 04:11:04,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (= ~SIZE~0 40000) (or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (< 0 (div (* (- 1) main_~i~0) (- 2))) (= (+ (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (div (* (- 1) main_~i~0) (- 2))) main_~sum~0)) (and (= main_~sum~0 0) (= main_~i~0 0)) (and (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) ~SIZE~0) 2) 1)) (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= (+ (* 3 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))) 1) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0))))} [48] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {203#(and (= ~SIZE~0 40000) (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ (* 2 (* (div (* (- 2) aux_div_main_~i~0_17) (- 2)) (div (* (- 2) aux_div_main_~i~0_17) (- 2)))) (div (* (- 2) aux_div_main_~i~0_17) (- 2))) main_~sum~0) (< aux_div_main_~i~0_17 (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (<= ~SIZE~0 (* 2 aux_div_main_~i~0_17)))))} is VALID [2022-04-08 04:11:04,566 INFO L272 TraceCheckUtils]: 8: Hoare triple {203#(and (= ~SIZE~0 40000) (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ (* 2 (* (div (* (- 2) aux_div_main_~i~0_17) (- 2)) (div (* (- 2) aux_div_main_~i~0_17) (- 2)))) (div (* (- 2) aux_div_main_~i~0_17) (- 2))) main_~sum~0) (< aux_div_main_~i~0_17 (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (<= ~SIZE~0 (* 2 aux_div_main_~i~0_17)))))} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:11:04,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:11:04,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {211#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {175#false} is VALID [2022-04-08 04:11:04,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-08 04:11:04,567 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:11:04,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:11:04,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:11:04,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678097843] [2022-04-08 04:11:04,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:11:04,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354817472] [2022-04-08 04:11:04,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354817472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:04,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:04,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:11:08,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:11:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785361913] [2022-04-08 04:11:08,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785361913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:11:08,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:11:08,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:11:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869813366] [2022-04-08 04:11:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:11:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-08 04:11:08,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:11:08,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:11:08,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:11:08,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:11:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:11:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:11:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:11:08,772 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:11:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:11,221 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 04:11:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:11:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-08 04:11:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:11:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:11:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-08 04:11:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:11:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2022-04-08 04:11:11,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2022-04-08 04:11:11,429 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:11:11,430 INFO L225 Difference]: With dead ends: 13 [2022-04-08 04:11:11,430 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:11:11,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:11:11,431 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:11:11,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-04-08 04:11:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:11:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:11:11,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:11:11,432 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:11:11,432 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:11:11,433 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:11:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:11,433 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:11:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:11:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:11,433 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:11:11,433 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:11:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:11:11,433 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:11:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:11:11,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:11,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:11:11,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:11:11,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:11:11,434 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:11:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:11:11,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-08 04:11:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:11:11,434 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:11:11,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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:11:11,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:11:11,434 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:11:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:11:11,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:11:11,436 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:11:11,442 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:11:11,640 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:11:11,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:11:15,316 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-08 04:11:15,317 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 29) the Hoare annotation is: true [2022-04-08 04:11:15,317 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-08 04:11:15,317 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 29) the Hoare annotation is: true [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 26) the Hoare annotation is: (or (not (= ~SIZE~0 40000)) (and (let ((.cse1 (* (- 1) main_~i~0))) (or (let ((.cse0 (div (+ .cse1 2) (- 2)))) (and (= 0 (mod main_~i~0 2)) (= (+ (* 3 .cse0) main_~i~0 (* (* .cse0 .cse0) 2) 1) main_~sum~0) (<= 0 .cse0))) (and (= main_~sum~0 main_~i~0) (= main_~i~0 1)) (let ((.cse2 (div (+ .cse1 1) (- 2)))) (and (= (+ main_~i~0 .cse2 (* 2 (* .cse2 .cse2))) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0) (< 0 .cse2))))) (< main_~i~0 (+ ~SIZE~0 1))) (and (= main_~sum~0 0) (= main_~i~0 0))) [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (or (not (= ~SIZE~0 40000)) (and (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ aux_div_main_~i~0_17 (* 2 (* aux_div_main_~i~0_17 aux_div_main_~i~0_17))) main_~sum~0) (< aux_div_main_~i~0_17 (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (<= ~SIZE~0 (* 2 aux_div_main_~i~0_17)))) (= (let ((.cse0 (div (+ (* (- 1) main_~i~0) 2) (- 2)))) (+ (* 3 .cse0) main_~i~0 (* (* .cse0 .cse0) 2) 1)) main_~sum~0))) [2022-04-08 04:11:15,318 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 29) the Hoare annotation is: true [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~SIZE~0 40000) [2022-04-08 04:11:15,318 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~SIZE~0 40000) [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (<= 40000 ~SIZE~0) [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~SIZE~0 40000) [2022-04-08 04:11:15,318 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:11:15,318 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (<= 40000 ~SIZE~0) [2022-04-08 04:11:15,319 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-08 04:11:15,319 INFO L878 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (or (not (<= 40000 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 04:11:15,319 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 15) the Hoare annotation is: (or (not (<= 40000 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 04:11:15,319 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 17) the Hoare annotation is: true [2022-04-08 04:11:15,319 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 17) the Hoare annotation is: true [2022-04-08 04:11:15,319 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (or (not (<= 40000 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 04:11:15,321 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-08 04:11:15,322 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:11:15,331 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:11:15,331 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 04:11:15,332 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 04:11:15,332 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 04:11:15,333 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 04:11:17,344 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-08 04:11:17,345 INFO L163 areAnnotationChecker]: CFG has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:11:17,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:11:17 BoogieIcfgContainer [2022-04-08 04:11:17,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:11:17,373 INFO L158 Benchmark]: Toolchain (without parser) took 60813.58ms. Allocated memory was 196.1MB in the beginning and 281.0MB in the end (delta: 84.9MB). Free memory was 142.7MB in the beginning and 223.9MB in the end (delta: -81.2MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. [2022-04-08 04:11:17,374 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:11:17,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.94ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 167.7MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:11:17,374 INFO L158 Benchmark]: Boogie Preprocessor took 28.12ms. Allocated memory is still 196.1MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:11:17,375 INFO L158 Benchmark]: RCFGBuilder took 282.01ms. Allocated memory is still 196.1MB. Free memory was 166.1MB in the beginning and 156.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 04:11:17,375 INFO L158 Benchmark]: TraceAbstraction took 60268.68ms. Allocated memory was 196.1MB in the beginning and 281.0MB in the end (delta: 84.9MB). Free memory was 155.6MB in the beginning and 223.9MB in the end (delta: -68.2MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2022-04-08 04:11:17,376 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.09ms. Allocated memory is still 196.1MB. Free memory was 159.0MB in the beginning and 159.0MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.94ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 167.7MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.12ms. Allocated memory is still 196.1MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.01ms. Allocated memory is still 196.1MB. Free memory was 166.1MB in the beginning and 156.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 60268.68ms. Allocated memory was 196.1MB in the beginning and 281.0MB in the end (delta: 84.9MB). Free memory was 155.6MB in the beginning and 223.9MB in the end (delta: -68.2MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * 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: 14]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 24 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 25 PreInvPairs, 34 NumberOfFragments, 233 HoareAnnotationTreeSize, 25 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 3.6s 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: 23]: Loop Invariant Derived loop invariant: (!(SIZE == 40000) || (((((0 == i % 2 && 3 * ((-1 * i + 2) / -2) + i + (-1 * i + 2) / -2 * ((-1 * i + 2) / -2) * 2 + 1 == sum) && 0 <= (-1 * i + 2) / -2) || (sum == i && i == 1)) || ((i + (-1 * i + 1) / -2 + 2 * ((-1 * i + 1) / -2 * ((-1 * i + 1) / -2)) == sum && (i + 1) % 2 == 0) && 0 < (-1 * i + 1) / -2)) && i < SIZE + 1)) || (sum == 0 && i == 0) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 04:11:17,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...