/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/benchmark20_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:10:20,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:10:20,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:10:20,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:10:20,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:10:20,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:10:20,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:10:20,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:10:20,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:10:20,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:10:20,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:10:20,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:10:20,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:10:20,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:10:20,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:10:20,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:10:20,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:10:20,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:10:20,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:10:20,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:10:20,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:10:20,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:10:20,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:10:20,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:10:20,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:10:20,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:10:20,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:10:20,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:10:20,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:10:20,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:10:20,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:10:20,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:10:20,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:10:20,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:10:20,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:10:20,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:10:20,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:10:20,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:10:20,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:10:20,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:10:20,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:10:20,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:10:20,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:10:20,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:10:20,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:10:20,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:10:20,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:10:20,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:10:20,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:10:20,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:10:20,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:10:20,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:10:20,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:10:20,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:10:20,871 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:10:20,871 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:10:20,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:10:20,871 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:10:20,871 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-15 07:10:21,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:10:21,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:10:21,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:10:21,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:10:21,148 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:10:21,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-15 07:10:21,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a3cd535/1a758341fe754fe8a20b688716a7e88a/FLAG259aa342c [2022-04-15 07:10:21,648 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:10:21,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-15 07:10:21,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a3cd535/1a758341fe754fe8a20b688716a7e88a/FLAG259aa342c [2022-04-15 07:10:22,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a3cd535/1a758341fe754fe8a20b688716a7e88a [2022-04-15 07:10:22,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:10:22,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:10:22,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:10:22,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:10:22,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:10:22,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6213fc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22, skipping insertion in model container [2022-04-15 07:10:22,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:10:22,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:10:22,256 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/benchmark20_conjunctive.i[873,886] [2022-04-15 07:10:22,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:10:22,278 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:10:22,295 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/benchmark20_conjunctive.i[873,886] [2022-04-15 07:10:22,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:10:22,309 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:10:22,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22 WrapperNode [2022-04-15 07:10:22,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:10:22,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:10:22,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:10:22,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:10:22,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:10:22,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:10:22,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:10:22,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:10:22,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (1/1) ... [2022-04-15 07:10:22,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:10:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:10:22,401 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-15 07:10:22,431 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-15 07:10:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:10:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:10:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:10:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:10:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:10:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:10:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 07:10:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 07:10:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:10:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:10:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:10:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:10:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:10:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:10:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:10:22,523 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:10:22,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:10:22,663 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:10:22,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:10:22,670 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:10:22,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:10:22 BoogieIcfgContainer [2022-04-15 07:10:22,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:10:22,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:10:22,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:10:22,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:10:22,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:10:22" (1/3) ... [2022-04-15 07:10:22,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e44276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:10:22, skipping insertion in model container [2022-04-15 07:10:22,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:10:22" (2/3) ... [2022-04-15 07:10:22,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e44276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:10:22, skipping insertion in model container [2022-04-15 07:10:22,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:10:22" (3/3) ... [2022-04-15 07:10:22,679 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.i [2022-04-15 07:10:22,684 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:10:22,684 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:10:22,744 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:10:22,750 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-15 07:10:22,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:10:22,769 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-15 07:10:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:10:22,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:22,778 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:22,778 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 07:10:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117015526] [2022-04-15 07:10:22,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:10:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 07:10:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:22,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626807893] [2022-04-15 07:10:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:23,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2); {23#true} is VALID [2022-04-15 07:10:23,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:10:23,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:10:23,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:23,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(26, 2); {23#true} is VALID [2022-04-15 07:10:23,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:10:23,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 07:10:23,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-15 07:10:23,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-15 07:10:23,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-15 07:10:23,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-15 07:10:23,102 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:10:23,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:10:23,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 07:10:23,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 07:10:23,104 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-15 07:10:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:23,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626807893] [2022-04-15 07:10:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626807893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:23,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:23,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:10:23,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:23,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117015526] [2022-04-15 07:10:23,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117015526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:23,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:23,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:10:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028518637] [2022-04-15 07:10:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:23,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,158 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-15 07:10:23,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:10:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:10:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:10:23,201 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:23,572 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-15 07:10:23,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:10:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:10:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 07:10:23,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 07:10:23,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:23,663 INFO L225 Difference]: With dead ends: 41 [2022-04-15 07:10:23,663 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 07:10:23,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:10:23,670 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:23,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:10:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 07:10:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 07:10:23,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:23,702 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-15 07:10:23,702 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-15 07:10:23,703 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-15 07:10:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:23,706 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:10:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:23,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:23,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:23,707 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-15 07:10:23,707 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-15 07:10:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:23,710 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:10:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:23,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:23,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:23,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:23,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:23,711 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-15 07:10:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 07:10:23,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 07:10:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:23,715 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 07:10:23,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 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-15 07:10:23,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 07:10:23,731 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-15 07:10:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 07:10:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 07:10:23,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:23,732 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:23,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:10:23,733 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 07:10:23,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:23,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983143929] [2022-04-15 07:10:25,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:25,163 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 07:10:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:25,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093195267] [2022-04-15 07:10:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:25,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:10:25,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636974050] [2022-04-15 07:10:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:25,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:10:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:10:25,223 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-15 07:10:25,236 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-15 07:10:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:25,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:10:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:25,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:11:03,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-15 07:11:03,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#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(26, 2); {180#true} is VALID [2022-04-15 07:11:03,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 07:11:03,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 07:11:03,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-15 07:11:03,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-15 07:11:03,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {203#(and (= main_~i~0 0) (<= 0 main_~sum~0))} is VALID [2022-04-15 07:11:03,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {203#(and (= main_~i~0 0) (<= 0 main_~sum~0))} [49] L24-2-->L24-3_primed: Formula: (let ((.cse3 (= v_main_~sum~0_9 v_main_~sum~0_8)) (.cse4 (= v_main_~i~0_8 v_main_~i~0_7)) (.cse5 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse1 (* (- 1) v_main_~i~0_8)) (.cse2 (* (- 1) v_main_~i~0_7))) (or (let ((.cse0 (div (+ v_main_~i~0_8 .cse2 1) (- 2)))) (and (< .cse0 (+ (div (+ (- 1) v_main_~n~0_6 .cse1) 2) 1)) (= (+ .cse0 v_main_~i~0_8 (* 2 (* .cse0 v_main_~i~0_8)) (* (* .cse0 .cse0) 2) v_main_~sum~0_9) v_main_~sum~0_8) (<= 0 .cse0) (= (mod (+ v_main_~i~0_8 v_main_~i~0_7 1) 2) 0))) (and .cse3 .cse4 (not (< v_main_~i~0_8 v_main_~n~0_6)) .cse5) (and .cse3 (= v_main_~n~0_6 v_main_~n~0_6) .cse4 .cse5) (let ((.cse6 (div (+ v_main_~i~0_8 .cse2) (- 2)))) (and (= (mod (+ v_main_~i~0_8 v_main_~i~0_7) 2) 0) (< .cse6 (+ (div (+ (- 2) v_main_~n~0_6 .cse1) 2) 2)) (< 0 .cse6) (= (+ .cse6 v_main_~sum~0_8) (+ (* 2 (* v_main_~i~0_8 .cse6)) (* (* .cse6 .cse6) 2) v_main_~sum~0_9)))))) InVars {main_~i~0=v_main_~i~0_8, main_#t~post4=|v_main_#t~post4_4|, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_9} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_6, main_~sum~0=v_main_~sum~0_8} AuxVars[] AssignedVars[main_~sum~0, main_#t~post4, main_~i~0] {207#(<= 0 main_~sum~0)} is VALID [2022-04-15 07:11:03,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(<= 0 main_~sum~0)} [48] L24-3_primed-->L24-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {207#(<= 0 main_~sum~0)} is VALID [2022-04-15 07:11:03,740 INFO L272 TraceCheckUtils]: 9: Hoare triple {207#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {214#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:11:03,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {218#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:11:03,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-15 07:11:03,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 07:11:03,741 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-15 07:11:03,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:11:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093195267] [2022-04-15 07:11:03,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:11:03,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636974050] [2022-04-15 07:11:03,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636974050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:03,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:03,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:11:04,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:04,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983143929] [2022-04-15 07:11:04,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983143929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:04,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:04,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:11:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282239817] [2022-04-15 07:11:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:04,505 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-15 07:11:04,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:04,507 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-15 07:11:04,551 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-15 07:11:04,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:11:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:04,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:11:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:11:04,553 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-15 07:11:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:04,600 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 07:11:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:11:04,600 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-15 07:11:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:04,601 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-15 07:11:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-15 07:11:04,602 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-15 07:11:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-15 07:11:04,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-15 07:11:05,032 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-15 07:11:05,032 INFO L225 Difference]: With dead ends: 14 [2022-04-15 07:11:05,032 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:11:05,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:11:05,034 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:05,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-04-15 07:11:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:11:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:11:05,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:05,036 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-15 07:11:05,036 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-15 07:11:05,036 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-15 07:11:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:05,037 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:05,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:05,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:05,037 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-15 07:11:05,037 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-15 07:11:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:05,038 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:11:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:05,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:05,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:05,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:05,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:05,038 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-15 07:11:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:11:05,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 07:11:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:05,039 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:11:05,039 INFO L479 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-15 07:11:05,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:11:05,039 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-15 07:11:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:11:05,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:05,042 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:11:05,061 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-15 07:11:05,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:11:05,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:11:05,418 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 07:11:05,418 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 07:11:05,418 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 07:11:05,418 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-15 07:11:05,418 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-15 07:11:05,419 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-15 07:11:05,419 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-15 07:11:05,419 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (exists ((v_main_~sum~0_11 Int)) (and (<= 0 v_main_~sum~0_11) (let ((.cse1 (* (- 1) main_~i~0)) (.cse2 (= main_~sum~0 v_main_~sum~0_11)) (.cse3 (= main_~i~0 0))) (or (let ((.cse0 (div (+ .cse1 1) (- 2)))) (and (<= 0 .cse0) (< .cse0 (+ (div (+ (- 1) main_~n~0) 2) 1)) (= (mod (+ main_~i~0 1) 2) 0) (= (+ .cse0 v_main_~sum~0_11 (* 2 (* .cse0 .cse0))) main_~sum~0))) (and (not (< 0 main_~n~0)) .cse2 .cse3) (let ((.cse4 (div .cse1 (- 2)))) (and (= 0 (mod main_~i~0 2)) (< 0 .cse4) (= (+ main_~sum~0 .cse4) (+ (* (* .cse4 .cse4) 2) v_main_~sum~0_11)) (< .cse4 (+ (div (+ (- 2) main_~n~0) 2) 2)))) (and .cse2 .cse3))))) [2022-04-15 07:11:05,419 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (<= 0 main_~sum~0) [2022-04-15 07:11:05,419 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-15 07:11:05,419 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:11:05,420 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:11:05,420 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:11:05,420 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-15 07:11:05,421 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 07:11:05,421 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:11:05,421 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:11:05,421 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:11:05,429 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 07:11:05,431 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:11:05,441 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:05,442 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:11:05,443 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 07:11:06,560 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-15 07:11:06,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,565 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,566 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:11:06 BoogieIcfgContainer [2022-04-15 07:11:06,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:11:06,574 INFO L158 Benchmark]: Toolchain (without parser) took 44489.35ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 135.2MB in the beginning and 124.1MB in the end (delta: 11.2MB). Peak memory consumption was 50.0MB. Max. memory is 8.0GB. [2022-04-15 07:11:06,574 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 186.6MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:11:06,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.43ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 162.3MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:11:06,575 INFO L158 Benchmark]: Boogie Preprocessor took 49.46ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:11:06,575 INFO L158 Benchmark]: RCFGBuilder took 310.95ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 150.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 07:11:06,576 INFO L158 Benchmark]: TraceAbstraction took 43899.76ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 149.4MB in the beginning and 124.1MB in the end (delta: 25.4MB). Peak memory consumption was 63.9MB. Max. memory is 8.0GB. [2022-04-15 07:11:06,577 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.21ms. Allocated memory is still 186.6MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.43ms. Allocated memory is still 186.6MB. Free memory was 135.0MB in the beginning and 162.3MB in the end (delta: -27.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.46ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 310.95ms. Allocated memory is still 186.6MB. Free memory was 160.7MB in the beginning and 150.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43899.76ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 149.4MB in the beginning and 124.1MB in the end (delta: 25.4MB). Peak memory consumption was 63.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 42.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 27 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 46 NumberOfFragments, 194 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 24]: Loop Invariant [2022-04-15 07:11:06,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,585 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,586 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] [2022-04-15 07:11:06,587 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~sum~0_11,QUANTIFIED] Derived loop invariant: (\exists v_main_~sum~0_11 : int :: 0 <= v_main_~sum~0_11 && ((((((0 <= (-1 * i + 1) / -2 && (-1 * i + 1) / -2 < (-1 + n) / 2 + 1) && (i + 1) % 2 == 0) && (-1 * i + 1) / -2 + v_main_~sum~0_11 + 2 * ((-1 * i + 1) / -2 * ((-1 * i + 1) / -2)) == sum) || ((!(0 < n) && sum == v_main_~sum~0_11) && i == 0)) || (((0 == i % 2 && 0 < -1 * i / -2) && sum + -1 * i / -2 == -1 * i / -2 * (-1 * i / -2) * 2 + v_main_~sum~0_11) && -1 * i / -2 < (-2 + n) / 2 + 2)) || (sum == v_main_~sum~0_11 && i == 0))) - 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: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:11:06,605 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...