/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/loop-zilu/benchmark52_polynomial.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:10:16,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:10:16,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:10:16,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:10:16,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:10:16,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:10:16,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:10:16,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:10:16,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:10:16,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:10:16,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:10:16,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:10:16,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:10:16,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:10:16,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:10:16,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:10:16,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:10:16,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:10:16,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:10:16,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:10:16,792 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:10:16,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:10:16,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:10:16,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:10:16,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:10:16,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:10:16,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:10:16,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:10:16,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:10:16,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:10:16,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:10:16,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:10:16,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:10:16,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:10:16,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:10:16,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:10:16,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:10:16,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:10:16,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:10:16,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:10:16,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:10:16,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:10:16,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:10:16,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:10:16,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:10:16,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:10:16,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:10:16,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:10:16,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:10:16,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:10:16,812 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:10:16,812 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-28 04:10:16,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:10:17,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:10:17,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:10:17,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:10:17,017 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:10:17,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i [2022-04-28 04:10:17,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac6af5ef/0ed7d0e087c94eaca35110e96bd5c716/FLAGf3a4dabe8 [2022-04-28 04:10:17,355 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:10:17,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i [2022-04-28 04:10:17,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac6af5ef/0ed7d0e087c94eaca35110e96bd5c716/FLAGf3a4dabe8 [2022-04-28 04:10:17,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac6af5ef/0ed7d0e087c94eaca35110e96bd5c716 [2022-04-28 04:10:17,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:10:17,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:10:17,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:10:17,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:10:17,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:10:17,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6782fecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17, skipping insertion in model container [2022-04-28 04:10:17,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:10:17,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:10:17,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i[872,885] [2022-04-28 04:10:17,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:10:17,928 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:10:17,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark52_polynomial.i[872,885] [2022-04-28 04:10:17,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:10:17,945 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:10:17,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17 WrapperNode [2022-04-28 04:10:17,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:10:17,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:10:17,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:10:17,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:10:17,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:10:17,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:10:17,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:10:17,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:10:17,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (1/1) ... [2022-04-28 04:10:17,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:10:17,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:17,981 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-28 04:10:17,995 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-28 04:10:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:10:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:10:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:10:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:10:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:10:18,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:10:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:10:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:10:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:10:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:10:18,048 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:10:18,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:10:18,168 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:10:18,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:10:18,172 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:10:18,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:10:18 BoogieIcfgContainer [2022-04-28 04:10:18,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:10:18,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:10:18,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:10:18,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:10:18,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:10:17" (1/3) ... [2022-04-28 04:10:18,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8489c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:10:18, skipping insertion in model container [2022-04-28 04:10:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:10:17" (2/3) ... [2022-04-28 04:10:18,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8489c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:10:18, skipping insertion in model container [2022-04-28 04:10:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:10:18" (3/3) ... [2022-04-28 04:10:18,179 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark52_polynomial.i [2022-04-28 04:10:18,187 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:10:18,188 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:10:18,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:10:18,241 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e1f1cc5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e5a240 [2022-04-28 04:10:18,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:10:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-28 04:10:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:10:18,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:18,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:18,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-28 04:10:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:18,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687673233] [2022-04-28 04:10:18,290 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:10:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-28 04:10:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:18,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339027433] [2022-04-28 04:10:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:18,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:10:18,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459050547] [2022-04-28 04:10:18,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:10:18,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:18,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:18,385 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-28 04:10:18,386 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-28 04:10:18,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:10:18,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:10:18,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 04:10:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:18,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:10:18,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2022-04-28 04:10:18,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#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(25, 2); {23#true} is VALID [2022-04-28 04:10:18,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:10:18,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-28 04:10:18,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-28 04:10:18,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2022-04-28 04:10:18,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~i~0 < 10 && ~i~0 > -10); {46#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-28 04:10:18,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} assume !(~i~0 * ~i~0 < 100); {24#false} is VALID [2022-04-28 04:10:18,634 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {24#false} is VALID [2022-04-28 04:10:18,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 04:10:18,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 04:10:18,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 04:10:18,636 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-28 04:10:18,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:10:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:18,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339027433] [2022-04-28 04:10:18,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:10:18,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459050547] [2022-04-28 04:10:18,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459050547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:18,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:18,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:10:18,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:18,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687673233] [2022-04-28 04:10:18,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687673233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:18,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:18,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:10:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519443670] [2022-04-28 04:10:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-28 04:10:18,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:18,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-28 04:10:18,656 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-28 04:10:18,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:10:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:10:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:10:18,672 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-28 04:10:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:18,719 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 04:10:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:10:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-28 04:10:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-28 04:10:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 04:10:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-28 04:10:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 04:10:18,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 04:10:18,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:18,770 INFO L225 Difference]: With dead ends: 33 [2022-04-28 04:10:18,771 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 04:10:18,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:10:18,774 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:18,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:10:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 04:10:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 04:10:18,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:18,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-28 04:10:18,795 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-28 04:10:18,795 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-28 04:10:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:18,797 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:10:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:10:18,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:18,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:18,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 14 states. [2022-04-28 04:10:18,798 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 14 states. [2022-04-28 04:10:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:18,799 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:10:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:10:18,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:18,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:18,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:18,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-28 04:10:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 04:10:18,805 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 04:10:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:18,805 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 04:10:18,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-28 04:10:18,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 04:10:18,816 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-28 04:10:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 04:10:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:10:18,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:18,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:18,835 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-28 04:10:19,031 WARN L477 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-28 04:10:19,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-28 04:10:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195867554] [2022-04-28 04:10:19,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:19,234 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-28 04:10:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:19,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988327519] [2022-04-28 04:10:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:19,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:10:19,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871890922] [2022-04-28 04:10:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:19,262 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-28 04:10:19,263 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-28 04:10:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 04:10:19,871 WARN L124 FreeRefinementEngine]: Strategy CAMEL was unsuccessful and could not determine trace feasibility [2022-04-28 04:10:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 2 times [2022-04-28 04:10:19,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:19,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308942252] [2022-04-28 04:10:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:19,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:10:19,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057821101] [2022-04-28 04:10:19,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:10:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:10:19,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:10:19,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:10:19,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:10:19,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:10:19,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:10:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:19,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:10:20,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2022-04-28 04:10:20,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#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(25, 2); {183#true} is VALID [2022-04-28 04:10:20,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-28 04:10:20,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #45#return; {183#true} is VALID [2022-04-28 04:10:20,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2022-04-28 04:10:20,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {183#true} is VALID [2022-04-28 04:10:20,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#true} assume !!(~i~0 < 10 && ~i~0 > -10); {206#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} is VALID [2022-04-28 04:10:20,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))} assume !!(~i~0 * ~i~0 < 100);~i~0 := 1 + ~i~0; {210#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} is VALID [2022-04-28 04:10:20,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)))} assume !(~i~0 * ~i~0 < 100); {214#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-28 04:10:20,186 INFO L272 TraceCheckUtils]: 9: Hoare triple {214#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {218#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:10:20,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {222#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:10:20,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {184#false} is VALID [2022-04-28 04:10:20,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-28 04:10:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:20,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:10:20,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-28 04:10:20,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {184#false} is VALID [2022-04-28 04:10:20,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {222#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:10:20,324 INFO L272 TraceCheckUtils]: 9: Hoare triple {214#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} call __VERIFIER_assert((if 10 == ~i~0 then 1 else 0)); {218#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:10:20,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} assume !(~i~0 * ~i~0 < 100); {214#(and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100)))} is VALID [2022-04-28 04:10:20,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {245#(or (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10)) (< (+ (* main_~i~0 main_~i~0) (* main_~i~0 2)) 99))} assume !!(~i~0 * ~i~0 < 100);~i~0 := 1 + ~i~0; {241#(or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (< (* main_~i~0 main_~i~0) 100))} is VALID [2022-04-28 04:10:20,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#true} assume !!(~i~0 < 10 && ~i~0 > -10); {245#(or (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10)) (< (+ (* main_~i~0 main_~i~0) (* main_~i~0 2)) 99))} is VALID [2022-04-28 04:10:20,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1; {183#true} is VALID [2022-04-28 04:10:20,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2022-04-28 04:10:20,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #45#return; {183#true} is VALID [2022-04-28 04:10:20,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-28 04:10:20,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#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(25, 2); {183#true} is VALID [2022-04-28 04:10:20,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2022-04-28 04:10:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:20,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:20,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308942252] [2022-04-28 04:10:20,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:10:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057821101] [2022-04-28 04:10:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057821101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:10:20,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:10:20,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 04:10:20,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:20,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195867554] [2022-04-28 04:10:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195867554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:20,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:20,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:10:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873316718] [2022-04-28 04:10:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:20,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:20,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,358 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-28 04:10:20,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:10:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:10:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:10:20,359 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:20,423 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 04:10:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:10:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-28 04:10:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-28 04:10:20,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-28 04:10:20,439 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-28 04:10:20,440 INFO L225 Difference]: With dead ends: 14 [2022-04-28 04:10:20,440 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:10:20,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:10:20,444 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:20,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:10:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:10:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:10:20,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:20,447 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-28 04:10:20,447 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-28 04:10:20,448 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-28 04:10:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:20,452 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:10:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:20,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:20,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:20,452 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-28 04:10:20,452 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-28 04:10:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:20,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:10:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:20,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:20,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:20,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:20,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:20,453 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-28 04:10:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:10:20,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-28 04:10:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:20,454 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:10:20,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-28 04:10:20,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:10:20,455 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-28 04:10:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:20,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:10:20,476 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-28 04:10:20,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:10:20,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:20,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:10:20,926 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 04:10:20,927 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 04:10:20,927 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 04:10:20,927 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 27) the Hoare annotation is: true [2022-04-28 04:10:20,927 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-28 04:10:20,927 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 27) the Hoare annotation is: true [2022-04-28 04:10:20,927 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 04:10:20,927 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (or (and (< main_~i~0 11) (< 0 (+ main_~i~0 9))) (and (< 0 (+ main_~i~0 10)) (< main_~i~0 10))) [2022-04-28 04:10:20,927 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (< main_~i~0 11) (< 0 (+ main_~i~0 9)) (not (< (* main_~i~0 main_~i~0) 100))) [2022-04-28 04:10:20,927 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 27) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:10:20,928 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:20,928 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:20,929 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:20,929 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:10:20,931 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2022-04-28 04:10:20,932 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:10:20,934 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:10:20,934 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:10:20,939 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 04:10:20,945 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:10:20,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:10:20 BoogieIcfgContainer [2022-04-28 04:10:20,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:10:20,958 INFO L158 Benchmark]: Toolchain (without parser) took 3170.02ms. Allocated memory was 198.2MB in the beginning and 261.1MB in the end (delta: 62.9MB). Free memory was 148.3MB in the beginning and 219.7MB in the end (delta: -71.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:10:20,958 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 164.9MB in the beginning and 164.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:10:20,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.29ms. Allocated memory is still 198.2MB. Free memory was 148.1MB in the beginning and 175.3MB in the end (delta: -27.2MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-28 04:10:20,959 INFO L158 Benchmark]: Boogie Preprocessor took 16.47ms. Allocated memory is still 198.2MB. Free memory was 175.3MB in the beginning and 174.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:10:20,959 INFO L158 Benchmark]: RCFGBuilder took 210.60ms. Allocated memory is still 198.2MB. Free memory was 173.8MB in the beginning and 162.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:10:20,959 INFO L158 Benchmark]: TraceAbstraction took 2782.29ms. Allocated memory was 198.2MB in the beginning and 261.1MB in the end (delta: 62.9MB). Free memory was 162.3MB in the beginning and 219.7MB in the end (delta: -57.5MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2022-04-28 04:10:20,961 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.10ms. Allocated memory is still 198.2MB. Free memory was 164.9MB in the beginning and 164.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 157.29ms. Allocated memory is still 198.2MB. Free memory was 148.1MB in the beginning and 175.3MB in the end (delta: -27.2MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.47ms. Allocated memory is still 198.2MB. Free memory was 175.3MB in the beginning and 174.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.60ms. Allocated memory is still 198.2MB. Free memory was 173.8MB in the beginning and 162.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2782.29ms. Allocated memory was 198.2MB in the beginning and 261.1MB in the end (delta: 62.9MB). Free memory was 162.3MB in the beginning and 219.7MB in the end (delta: -57.5MB). Peak memory consumption was 5.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: 16]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 28 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 20 LocationsWithAnnotation, 26 PreInvPairs, 35 NumberOfFragments, 65 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 22]: Loop Invariant Derived loop invariant: (i < 11 && 0 < i + 9) || (0 < i + 10 && i < 10) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:10:20,994 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...